/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:44:29,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:44:29,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:44:29,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:44:29,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:44:29,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:44:29,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:44:29,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:44:29,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:44:29,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:44:29,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:44:29,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:44:29,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:44:29,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:44:29,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:44:29,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:44:29,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:44:29,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:44:29,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:44:29,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:44:29,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:44:29,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:44:29,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:44:29,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:44:29,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:44:29,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:44:29,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:44:29,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:44:29,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:44:29,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:44:29,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:44:29,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:44:29,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:44:29,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:44:29,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:44:29,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:44:29,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:44:29,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:44:29,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:44:29,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:44:29,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:44:29,717 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:44:29,740 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:44:29,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:44:29,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:44:29,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:44:29,743 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:44:29,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:44:29,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:44:29,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:44:29,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:44:29,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:44:29,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:44:29,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:44:29,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:44:29,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:44:29,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:29,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:44:29,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:44:29,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:44:29,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:44:29,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:44:29,746 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:44:29,746 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 05:44:30,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:44:30,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:44:30,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:44:30,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:44:30,017 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:44:30,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 05:44:31,035 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:44:31,248 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:44:31,249 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 05:44:31,255 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8ac53bf/527cd9f66d2945889059374f2e42e5db/FLAGf652b2641 [2022-12-06 05:44:31,265 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8ac53bf/527cd9f66d2945889059374f2e42e5db [2022-12-06 05:44:31,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:44:31,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:44:31,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:31,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:44:31,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:44:31,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ed61ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31, skipping insertion in model container [2022-12-06 05:44:31,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:44:31,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:44:31,435 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/unroll-2.wvr.c[2428,2441] [2022-12-06 05:44:31,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:31,456 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:44:31,484 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/unroll-2.wvr.c[2428,2441] [2022-12-06 05:44:31,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:31,498 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:44:31,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31 WrapperNode [2022-12-06 05:44:31,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:31,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:31,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:44:31,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:44:31,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,544 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-06 05:44:31,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:31,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:44:31,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:44:31,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:44:31,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,574 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:44:31,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:44:31,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:44:31,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:44:31,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (1/1) ... [2022-12-06 05:44:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:31,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:31,635 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 05:44:31,642 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 05:44:31,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:44:31,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:44:31,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:44:31,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:44:31,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:44:31,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:44:31,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:44:31,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:44:31,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:44:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:44:31,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:44:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:44:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:44:31,667 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 05:44:31,744 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:44:31,745 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:44:31,900 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:44:31,906 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:44:31,906 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:44:31,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:31 BoogieIcfgContainer [2022-12-06 05:44:31,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:44:31,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:44:31,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:44:31,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:44:31,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:44:31" (1/3) ... [2022-12-06 05:44:31,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5b8d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:31, skipping insertion in model container [2022-12-06 05:44:31,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:31" (2/3) ... [2022-12-06 05:44:31,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5b8d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:31, skipping insertion in model container [2022-12-06 05:44:31,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:31" (3/3) ... [2022-12-06 05:44:31,914 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-06 05:44:31,926 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:44:31,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:44:31,933 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:44:32,054 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:44:32,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 05:44:32,153 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-06 05:44:32,153 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:32,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 14/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 05:44:32,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 05:44:32,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-06 05:44:32,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:32,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 05:44:32,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-06 05:44:32,210 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-06 05:44:32,210 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:32,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 14/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 05:44:32,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 05:44:32,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-06 05:44:36,065 INFO L203 LiptonReduction]: Total number of compositions: 127 [2022-12-06 05:44:36,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:44:36,081 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;@790c9e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:44:36,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:44:36,084 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:44:36,084 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:36,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:36,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:36,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-06 05:44:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:36,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819663505] [2022-12-06 05:44:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:36,320 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 05:44:36,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:36,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819663505] [2022-12-06 05:44:36,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819663505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:36,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:36,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:44:36,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516075445] [2022-12-06 05:44:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:36,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:36,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:44:36,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 05:44:36,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:36,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:44:36,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:36,420 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 05:44:36,420 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:44:36,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 05:44:36,421 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 05:44:36,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 05:44:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 05:44:36,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 05:44:36,431 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 05:44:36,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 05:44:36,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:44:36,436 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:36,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 05:44:36,466 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:44:36,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:36,467 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:36,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:36,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:36,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:36,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:36,476 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:44:36,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:44:36,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 05:44:36,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:36,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:44:37,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:37,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 829 [2022-12-06 05:44:37,295 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 05:44:37,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 05:44:37,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:37,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:37,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:44:37,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-06 05:44:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:37,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308249166] [2022-12-06 05:44:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:37,496 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 05:44:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308249166] [2022-12-06 05:44:37,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308249166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:37,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:37,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:44:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397046943] [2022-12-06 05:44:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:37,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:37,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:44:37,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 05:44:37,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:37,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:44:37,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:37,576 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 05:44:37,576 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:44:37,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 05:44:37,577 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 05:44:37,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 05:44:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:44:37,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 05:44:37,578 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:44:37,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 05:44:37,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:37,579 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:37,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-06 05:44:37,580 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:44:37,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:37,580 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:37,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:37,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:37,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:37,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:37,584 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 05:44:37,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:44:37,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 05:44:37,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:37,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 05:44:37,585 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:37,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 05:44:37,586 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:37,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 05:44:37,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:37,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:37,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:44:37,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 166108600, now seen corresponding path program 1 times [2022-12-06 05:44:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:37,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144698906] [2022-12-06 05:44:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:37,713 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 05:44:37,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:37,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144698906] [2022-12-06 05:44:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144698906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:37,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:37,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:37,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614193316] [2022-12-06 05:44:37,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:37,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:37,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:37,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:37,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:44:37,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 05:44:37,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:37,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:44:37,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:37,840 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 05:44:37,840 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 05:44:37,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 169 events. 87/169 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 517 event pairs, 30 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 132. Up to 98 conditions per place. [2022-12-06 05:44:37,841 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 6/40 dead transitions. [2022-12-06 05:44:37,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 40 transitions, 193 flow [2022-12-06 05:44:37,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 05:44:37,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-06 05:44:37,844 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 39 transitions. [2022-12-06 05:44:37,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 40 transitions, 193 flow [2022-12-06 05:44:37,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 40 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:37,845 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:37,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 05:44:37,846 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:44:37,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:37,846 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:37,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:37,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:37,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:37,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 05:44:37,850 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-06 05:44:37,850 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 05:44:37,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 34 events. 7/34 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 46. Up to 11 conditions per place. [2022-12-06 05:44:37,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 05:44:37,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 05:44:38,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:38,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 05:44:38,047 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 05:44:38,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 05:44:38,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:38,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:38,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:44:38,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1536303008, now seen corresponding path program 1 times [2022-12-06 05:44:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:38,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327871647] [2022-12-06 05:44:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:38,172 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 05:44:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:38,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327871647] [2022-12-06 05:44:38,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327871647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:38,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390979847] [2022-12-06 05:44:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:38,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:38,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:38,175 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 05:44:38,213 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 05:44:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:38,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:44:38,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:38,306 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 05:44:38,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:38,333 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 05:44:38,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390979847] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:38,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:44:38,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-06 05:44:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525381739] [2022-12-06 05:44:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:38,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:38,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:38,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 05:44:38,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 05:44:38,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:38,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 05:44:38,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:38,369 INFO L130 PetriNetUnfolder]: 59/109 cut-off events. [2022-12-06 05:44:38,369 INFO L131 PetriNetUnfolder]: For 168/174 co-relation queries the response was YES. [2022-12-06 05:44:38,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 109 events. 59/109 cut-off events. For 168/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 299 event pairs, 10 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 203. Up to 76 conditions per place. [2022-12-06 05:44:38,370 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-12-06 05:44:38,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-06 05:44:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:44:38,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 05:44:38,371 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-06 05:44:38,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-06 05:44:38,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 27 transitions, 135 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:38,372 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-06 05:44:38,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-06 05:44:38,373 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 05:44:38,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:38,373 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-06 05:44:38,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:38,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:38,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-06 05:44:38,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-06 05:44:38,377 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-06 05:44:38,377 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 05:44:38,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 27 events. 7/27 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-06 05:44:38,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-06 05:44:38,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 05:44:38,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:38,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 05:44:38,378 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-06 05:44:38,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 05:44:38,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:38,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:38,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:38,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:38,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash -774279310, now seen corresponding path program 1 times [2022-12-06 05:44:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:38,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083052514] [2022-12-06 05:44:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:38,655 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 05:44:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083052514] [2022-12-06 05:44:38,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083052514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:38,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:38,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565686173] [2022-12-06 05:44:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:38,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:38,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:38,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:44:38,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:44:38,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:38,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:44:38,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:38,719 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-06 05:44:38,720 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 05:44:38,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 119 events. 61/119 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 308 event pairs, 20 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 125. Up to 76 conditions per place. [2022-12-06 05:44:38,724 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-06 05:44:38,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 184 flow [2022-12-06 05:44:38,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 05:44:38,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:44:38,727 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-06 05:44:38,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 35 transitions, 184 flow [2022-12-06 05:44:38,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 35 transitions, 169 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:38,730 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:38,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-06 05:44:38,733 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 05:44:38,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:38,733 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:38,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:38,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:38,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:38,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:38,738 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-06 05:44:38,738 INFO L131 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2022-12-06 05:44:38,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 31 events. 6/31 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 39. Up to 9 conditions per place. [2022-12-06 05:44:38,739 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:38,739 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 05:44:38,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:38,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:44:38,924 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-06 05:44:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:44:38,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:38,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:38,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:44:38,924 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1396315567, now seen corresponding path program 1 times [2022-12-06 05:44:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:38,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968826843] [2022-12-06 05:44:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:39,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968826843] [2022-12-06 05:44:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968826843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:39,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:39,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:39,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369159248] [2022-12-06 05:44:39,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:39,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:39,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:39,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:44:39,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:39,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:39,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:44:39,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:39,060 INFO L130 PetriNetUnfolder]: 44/84 cut-off events. [2022-12-06 05:44:39,061 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 05:44:39,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 84 events. 44/84 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 179 event pairs, 11 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 165. Up to 68 conditions per place. [2022-12-06 05:44:39,062 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 3/25 dead transitions. [2022-12-06 05:44:39,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 143 flow [2022-12-06 05:44:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 05:44:39,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 05:44:39,064 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 26 transitions. [2022-12-06 05:44:39,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 143 flow [2022-12-06 05:44:39,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 126 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:39,066 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-06 05:44:39,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2022-12-06 05:44:39,068 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:44:39,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:39,068 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-06 05:44:39,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:39,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:39,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-06 05:44:39,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-06 05:44:39,072 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-06 05:44:39,072 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:44:39,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 6/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 9 conditions per place. [2022-12-06 05:44:39,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-06 05:44:39,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:44:39,073 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:39,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 05:44:39,075 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-06 05:44:39,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:39,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:39,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:39,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:44:39,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1385749717, now seen corresponding path program 1 times [2022-12-06 05:44:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:39,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291443604] [2022-12-06 05:44:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:39,155 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 05:44:39,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:39,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291443604] [2022-12-06 05:44:39,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291443604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:39,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:39,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756996062] [2022-12-06 05:44:39,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:39,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:39,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:39,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:44:39,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:39,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:39,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:39,234 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-06 05:44:39,234 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 05:44:39,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 119 events. 61/119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 316 event pairs, 16 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 265. Up to 76 conditions per place. [2022-12-06 05:44:39,235 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-06 05:44:39,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 176 flow [2022-12-06 05:44:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:44:39,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-06 05:44:39,237 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:44:39,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 176 flow [2022-12-06 05:44:39,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:39,239 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 87 flow [2022-12-06 05:44:39,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 05:44:39,239 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:44:39,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:39,239 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 87 flow [2022-12-06 05:44:39,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:39,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:39,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-06 05:44:39,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 87 flow [2022-12-06 05:44:39,244 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-06 05:44:39,244 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 05:44:39,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 37 events. 8/37 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 53. Up to 13 conditions per place. [2022-12-06 05:44:39,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-06 05:44:39,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:44:39,246 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:39,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 05:44:39,248 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 87 flow [2022-12-06 05:44:39,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:44:39,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:39,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:39,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:44:39,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:39,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:39,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1328554519, now seen corresponding path program 2 times [2022-12-06 05:44:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:39,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343252742] [2022-12-06 05:44:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:39,320 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 05:44:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343252742] [2022-12-06 05:44:39,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343252742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:39,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:39,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199447466] [2022-12-06 05:44:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:39,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:39,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:39,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:44:39,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:39,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:39,395 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-06 05:44:39,395 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-06 05:44:39,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 94 events. 52/94 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 148. Up to 76 conditions per place. [2022-12-06 05:44:39,396 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2022-12-06 05:44:39,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 154 flow [2022-12-06 05:44:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 05:44:39,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 05:44:39,397 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 87 flow. Second operand 3 states and 27 transitions. [2022-12-06 05:44:39,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 154 flow [2022-12-06 05:44:39,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 141 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:39,399 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2022-12-06 05:44:39,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-06 05:44:39,401 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 05:44:39,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:39,401 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 05:44:39,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:39,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:39,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 05:44:39,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 05:44:39,405 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-06 05:44:39,405 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:44:39,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 8/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-06 05:44:39,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 05:44:39,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 05:44:39,412 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:39,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:44:39,414 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-06 05:44:39,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:44:39,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:39,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:39,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:44:39,414 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:39,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2064777642, now seen corresponding path program 1 times [2022-12-06 05:44:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:39,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552726791] [2022-12-06 05:44:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:39,800 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 05:44:39,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:39,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552726791] [2022-12-06 05:44:39,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552726791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:39,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320880104] [2022-12-06 05:44:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:39,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:39,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:39,817 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 05:44:39,846 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 05:44:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:39,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:44:39,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:39,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:44:39,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:44:39,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:44:40,031 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-06 05:44:40,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 35 [2022-12-06 05:44:40,044 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 05:44:40,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:40,167 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (< .cse0 0) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (= (select .cse1 (+ c_~f~0.offset (* .cse0 4))) (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset))))))) is different from false [2022-12-06 05:44:40,575 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 05:44:40,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320880104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:40,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:40,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:44:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539163466] [2022-12-06 05:44:40,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:40,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:44:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:44:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=141, Unknown=2, NotChecked=24, Total=210 [2022-12-06 05:44:40,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:40,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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 05:44:40,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:40,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:40,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:40,976 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2022-12-06 05:44:40,976 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 05:44:40,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 218 events. 121/218 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 682 event pairs, 14 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 110. Up to 105 conditions per place. [2022-12-06 05:44:40,977 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 20 selfloop transitions, 4 changer transitions 37/61 dead transitions. [2022-12-06 05:44:40,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 61 transitions, 343 flow [2022-12-06 05:44:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:44:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:44:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-06 05:44:40,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-06 05:44:40,980 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 9 states and 60 transitions. [2022-12-06 05:44:40,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 61 transitions, 343 flow [2022-12-06 05:44:40,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 61 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:40,982 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 100 flow [2022-12-06 05:44:40,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-06 05:44:40,982 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 05:44:40,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:40,983 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 100 flow [2022-12-06 05:44:40,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:40,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:40,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 100 flow [2022-12-06 05:44:40,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 100 flow [2022-12-06 05:44:40,990 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-06 05:44:40,990 INFO L131 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2022-12-06 05:44:40,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 30 events. 8/30 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 71. Up to 13 conditions per place. [2022-12-06 05:44:40,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 100 flow [2022-12-06 05:44:40,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 05:44:41,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:41,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 840 [2022-12-06 05:44:41,822 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 96 flow [2022-12-06 05:44:41,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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 05:44:41,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:41,823 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:41,830 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 05:44:42,023 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,SelfDestructingSolverStorable8 [2022-12-06 05:44:42,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash -380380717, now seen corresponding path program 1 times [2022-12-06 05:44:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:42,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113715545] [2022-12-06 05:44:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:42,767 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 05:44:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:42,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113715545] [2022-12-06 05:44:42,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113715545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314303129] [2022-12-06 05:44:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:42,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:42,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:44:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:42,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:44:42,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:42,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:42,907 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 05:44:42,911 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 05:44:42,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:42,958 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-06 05:44:42,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-06 05:44:42,996 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 05:44:42,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314303129] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:42,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:42,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-06 05:44:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390144368] [2022-12-06 05:44:42,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:42,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:44:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:44:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:44:42,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:42,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 96 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 05:44:42,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:42,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:42,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:43,301 INFO L130 PetriNetUnfolder]: 139/255 cut-off events. [2022-12-06 05:44:43,301 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-06 05:44:43,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 255 events. 139/255 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 788 event pairs, 10 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 845. Up to 118 conditions per place. [2022-12-06 05:44:43,303 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 57 selfloop transitions, 25 changer transitions 1/83 dead transitions. [2022-12-06 05:44:43,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 507 flow [2022-12-06 05:44:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:44:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:44:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2022-12-06 05:44:43,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36403508771929827 [2022-12-06 05:44:43,305 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 96 flow. Second operand 12 states and 83 transitions. [2022-12-06 05:44:43,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 507 flow [2022-12-06 05:44:43,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 83 transitions, 437 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 05:44:43,308 INFO L231 Difference]: Finished difference. Result has 36 places, 44 transitions, 246 flow [2022-12-06 05:44:43,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=246, PETRI_PLACES=36, PETRI_TRANSITIONS=44} [2022-12-06 05:44:43,309 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 05:44:43,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:43,309 INFO L89 Accepts]: Start accepts. Operand has 36 places, 44 transitions, 246 flow [2022-12-06 05:44:43,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:43,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:43,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-06 05:44:43,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 44 transitions, 246 flow [2022-12-06 05:44:43,318 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-06 05:44:43,319 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-06 05:44:43,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 85 events. 24/85 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 167. Up to 36 conditions per place. [2022-12-06 05:44:43,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-06 05:44:43,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 05:44:43,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:44:43,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 05:44:44,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 05:44:44,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:44:44,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (<= 0 v_~x1~0_147) (< v_~x1~0_147 v_~size~0_116)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (store |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47| (store (select |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre12#1_54|)) |v_#memory_int_171|) (= (select (select |v_#memory_int_172| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~x1~0_147 4))) v_~x1~0_146) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_128| 1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_128| 4294967295) 4294967296) (* (mod v_~n~0_115 2147483648) 2)) (= |v_ULTIMATE.start_main_#t~pre12#1_54| |v_#pthreadsForks_68|) (= |v_#pthreadsForks_67| (+ |v_#pthreadsForks_68| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_68|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_172|, ~n~0=v_~n~0_115, ~x1~0=v_~x1~0_147, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ~f~0.offset=v_~f~0.offset_104} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, ~x1~0=v_~x1~0_146, ~f~0.offset=v_~f~0.offset_104, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_54|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_43|, #pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_57|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_128|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, ~n~0=v_~n~0_115, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:44,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_175| v_~f~0.base_106))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_106 (* v_~x2~0_116 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (ite (and (< .cse0 v_~size~0_118) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= v_~x1~0_150 (select .cse1 (+ v_~f~0.offset_106 (* v_~x1~0_151 4)))) (= v_~x2~0_115 (select .cse1 (+ v_~f~0.offset_106 (* .cse0 4)))) (= (ite (and (< v_~x1~0_151 v_~size~0_118) (<= 0 v_~x1~0_151)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_116) (< v_~x2~0_116 v_~size~0_118)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_130| 1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_95|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) (* 2 (mod v_~n~0_117 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0))))) InVars {~x2~0=v_~x2~0_116, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_117, ~x1~0=v_~x1~0_151, ~f~0.offset=v_~f~0.offset_106} OutVars{~x2~0=v_~x2~0_115, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_82|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_95|, ~x1~0=v_~x1~0_150, ~f~0.offset=v_~f~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_36|, ~n~0=v_~n~0_117, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_36|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_90|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:45,052 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_155| v_~f~0.base_90))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_90 (* v_~x2~0_112 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_100| 1) (= (ite (and (<= 0 v_~x1~0_109) (< v_~x1~0_109 v_~size~0_102)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 2 (mod v_~n~0_101 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_102)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= (ite (and (<= 0 v_~x2~0_112) (< v_~x2~0_112 v_~size~0_102)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (select .cse1 (+ v_~f~0.offset_90 (* .cse0 4))) v_~x2~0_111) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|) (= (select .cse1 (+ v_~f~0.offset_90 (* v_~x1~0_109 4))) v_~x1~0_108)))) InVars {~x2~0=v_~x2~0_112, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_101, ~x1~0=v_~x1~0_109, ~f~0.offset=v_~f~0.offset_90} OutVars{~x2~0=v_~x2~0_111, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_56|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_44|, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~x1~0=v_~x1~0_108, ~f~0.offset=v_~f~0.offset_90, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_100|, #memory_int=|v_#memory_int_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_34|, ~n~0=v_~n~0_101, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_34|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_64|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:47,651 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 05:44:47,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4343 [2022-12-06 05:44:47,652 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-06 05:44:47,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 05:44:47,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:47,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:47,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:47,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:47,858 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1202382836, now seen corresponding path program 1 times [2022-12-06 05:44:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358112064] [2022-12-06 05:44:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:48,334 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 05:44:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:48,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358112064] [2022-12-06 05:44:48,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358112064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:48,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:48,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816441663] [2022-12-06 05:44:48,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:48,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:48,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:48,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:48,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:44:48,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 42 transitions, 276 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:44:48,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:48,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:44:48,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:48,464 INFO L130 PetriNetUnfolder]: 151/272 cut-off events. [2022-12-06 05:44:48,464 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-06 05:44:48,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 272 events. 151/272 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 885 event pairs, 42 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 634. Up to 237 conditions per place. [2022-12-06 05:44:48,466 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2022-12-06 05:44:48,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 425 flow [2022-12-06 05:44:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 05:44:48,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-06 05:44:48,467 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 4 states and 46 transitions. [2022-12-06 05:44:48,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 425 flow [2022-12-06 05:44:48,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 349 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:48,469 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 249 flow [2022-12-06 05:44:48,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2022-12-06 05:44:48,469 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 05:44:48,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:48,469 INFO L89 Accepts]: Start accepts. Operand has 36 places, 43 transitions, 249 flow [2022-12-06 05:44:48,470 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:48,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:48,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 43 transitions, 249 flow [2022-12-06 05:44:48,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 43 transitions, 249 flow [2022-12-06 05:44:48,478 INFO L130 PetriNetUnfolder]: 25/88 cut-off events. [2022-12-06 05:44:48,478 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-06 05:44:48,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 88 events. 25/88 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 184. Up to 30 conditions per place. [2022-12-06 05:44:48,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 43 transitions, 249 flow [2022-12-06 05:44:48,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 05:44:48,479 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:48,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:44:48,481 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 43 transitions, 249 flow [2022-12-06 05:44:48,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:44:48,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:48,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:48,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:44:48,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:48,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1205008728, now seen corresponding path program 1 times [2022-12-06 05:44:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:48,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020377715] [2022-12-06 05:44:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:48,689 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 05:44:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020377715] [2022-12-06 05:44:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020377715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:48,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:48,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483403283] [2022-12-06 05:44:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:48,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:48,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:48,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:44:48,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 43 transitions, 249 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:48,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:48,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:44:48,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:48,814 INFO L130 PetriNetUnfolder]: 201/355 cut-off events. [2022-12-06 05:44:48,814 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-12-06 05:44:48,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 355 events. 201/355 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1296 event pairs, 24 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 863. Up to 227 conditions per place. [2022-12-06 05:44:48,816 INFO L137 encePairwiseOnDemand]: 11/29 looper letters, 37 selfloop transitions, 26 changer transitions 1/64 dead transitions. [2022-12-06 05:44:48,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 64 transitions, 464 flow [2022-12-06 05:44:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 05:44:48,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35172413793103446 [2022-12-06 05:44:48,817 INFO L175 Difference]: Start difference. First operand has 35 places, 43 transitions, 249 flow. Second operand 5 states and 51 transitions. [2022-12-06 05:44:48,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 64 transitions, 464 flow [2022-12-06 05:44:48,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 442 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:48,820 INFO L231 Difference]: Finished difference. Result has 38 places, 51 transitions, 369 flow [2022-12-06 05:44:48,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=38, PETRI_TRANSITIONS=51} [2022-12-06 05:44:48,820 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 05:44:48,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:48,820 INFO L89 Accepts]: Start accepts. Operand has 38 places, 51 transitions, 369 flow [2022-12-06 05:44:48,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:48,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:48,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 51 transitions, 369 flow [2022-12-06 05:44:48,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 51 transitions, 369 flow [2022-12-06 05:44:48,829 INFO L130 PetriNetUnfolder]: 30/103 cut-off events. [2022-12-06 05:44:48,829 INFO L131 PetriNetUnfolder]: For 99/104 co-relation queries the response was YES. [2022-12-06 05:44:48,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 103 events. 30/103 cut-off events. For 99/104 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 0 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 226. Up to 36 conditions per place. [2022-12-06 05:44:48,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 51 transitions, 369 flow [2022-12-06 05:44:48,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:44:48,830 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:48,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:44:48,831 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 51 transitions, 369 flow [2022-12-06 05:44:48,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:48,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:48,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:48,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:44:48,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash -7334795, now seen corresponding path program 1 times [2022-12-06 05:44:48,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:48,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761184513] [2022-12-06 05:44:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:48,878 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 05:44:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761184513] [2022-12-06 05:44:48,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761184513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:48,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:48,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743993942] [2022-12-06 05:44:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:48,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:48,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:48,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:44:48,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 51 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:48,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:48,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:44:48,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:48,955 INFO L130 PetriNetUnfolder]: 212/374 cut-off events. [2022-12-06 05:44:48,956 INFO L131 PetriNetUnfolder]: For 629/629 co-relation queries the response was YES. [2022-12-06 05:44:48,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 374 events. 212/374 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1381 event pairs, 91 based on Foata normal form. 8/365 useless extension candidates. Maximal degree in co-relation 909. Up to 345 conditions per place. [2022-12-06 05:44:48,958 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 53 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-06 05:44:48,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 520 flow [2022-12-06 05:44:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 05:44:48,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2022-12-06 05:44:48,958 INFO L175 Difference]: Start difference. First operand has 38 places, 51 transitions, 369 flow. Second operand 3 states and 37 transitions. [2022-12-06 05:44:48,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 520 flow [2022-12-06 05:44:48,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:48,961 INFO L231 Difference]: Finished difference. Result has 40 places, 52 transitions, 384 flow [2022-12-06 05:44:48,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=40, PETRI_TRANSITIONS=52} [2022-12-06 05:44:48,962 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 05:44:48,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:48,962 INFO L89 Accepts]: Start accepts. Operand has 40 places, 52 transitions, 384 flow [2022-12-06 05:44:48,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:48,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:48,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 52 transitions, 384 flow [2022-12-06 05:44:48,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 52 transitions, 384 flow [2022-12-06 05:44:48,973 INFO L130 PetriNetUnfolder]: 33/113 cut-off events. [2022-12-06 05:44:48,973 INFO L131 PetriNetUnfolder]: For 106/110 co-relation queries the response was YES. [2022-12-06 05:44:48,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 113 events. 33/113 cut-off events. For 106/110 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 278. Up to 42 conditions per place. [2022-12-06 05:44:48,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 52 transitions, 384 flow [2022-12-06 05:44:48,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:44:48,974 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:48,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:44:48,975 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 52 transitions, 384 flow [2022-12-06 05:44:48,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:48,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:48,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:48,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:44:48,975 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:48,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1927888959, now seen corresponding path program 1 times [2022-12-06 05:44:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854883717] [2022-12-06 05:44:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:49,077 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 05:44:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854883717] [2022-12-06 05:44:49,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854883717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:49,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:49,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674550426] [2022-12-06 05:44:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:49,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:49,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:44:49,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 52 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:49,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:49,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:44:49,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:49,178 INFO L130 PetriNetUnfolder]: 206/368 cut-off events. [2022-12-06 05:44:49,178 INFO L131 PetriNetUnfolder]: For 755/755 co-relation queries the response was YES. [2022-12-06 05:44:49,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 368 events. 206/368 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1366 event pairs, 87 based on Foata normal form. 6/357 useless extension candidates. Maximal degree in co-relation 1207. Up to 346 conditions per place. [2022-12-06 05:44:49,180 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 49 selfloop transitions, 4 changer transitions 8/61 dead transitions. [2022-12-06 05:44:49,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 534 flow [2022-12-06 05:44:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 05:44:49,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 05:44:49,181 INFO L175 Difference]: Start difference. First operand has 40 places, 52 transitions, 384 flow. Second operand 4 states and 42 transitions. [2022-12-06 05:44:49,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 534 flow [2022-12-06 05:44:49,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 525 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:49,185 INFO L231 Difference]: Finished difference. Result has 43 places, 52 transitions, 391 flow [2022-12-06 05:44:49,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=43, PETRI_TRANSITIONS=52} [2022-12-06 05:44:49,185 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 05:44:49,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:49,185 INFO L89 Accepts]: Start accepts. Operand has 43 places, 52 transitions, 391 flow [2022-12-06 05:44:49,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:49,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:49,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 52 transitions, 391 flow [2022-12-06 05:44:49,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 52 transitions, 391 flow [2022-12-06 05:44:49,197 INFO L130 PetriNetUnfolder]: 39/126 cut-off events. [2022-12-06 05:44:49,197 INFO L131 PetriNetUnfolder]: For 141/145 co-relation queries the response was YES. [2022-12-06 05:44:49,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 126 events. 39/126 cut-off events. For 141/145 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 512 event pairs, 6 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 375. Up to 42 conditions per place. [2022-12-06 05:44:49,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 52 transitions, 391 flow [2022-12-06 05:44:49,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 05:44:49,198 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:49,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:44:49,199 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 52 transitions, 391 flow [2022-12-06 05:44:49,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:49,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:49,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:49,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:44:49,199 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1573840658, now seen corresponding path program 1 times [2022-12-06 05:44:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:49,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245972888] [2022-12-06 05:44:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:49,603 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 05:44:49,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:49,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245972888] [2022-12-06 05:44:49,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245972888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:49,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:49,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:49,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013934939] [2022-12-06 05:44:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:49,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:49,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:49,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:44:49,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 52 transitions, 391 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:49,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:49,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:44:49,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:49,748 INFO L130 PetriNetUnfolder]: 221/389 cut-off events. [2022-12-06 05:44:49,748 INFO L131 PetriNetUnfolder]: For 759/759 co-relation queries the response was YES. [2022-12-06 05:44:49,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 389 events. 221/389 cut-off events. For 759/759 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1452 event pairs, 53 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1432. Up to 344 conditions per place. [2022-12-06 05:44:49,752 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 50 selfloop transitions, 17 changer transitions 1/68 dead transitions. [2022-12-06 05:44:49,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 598 flow [2022-12-06 05:44:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 05:44:49,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33793103448275863 [2022-12-06 05:44:49,753 INFO L175 Difference]: Start difference. First operand has 42 places, 52 transitions, 391 flow. Second operand 5 states and 49 transitions. [2022-12-06 05:44:49,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 598 flow [2022-12-06 05:44:49,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 574 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:49,765 INFO L231 Difference]: Finished difference. Result has 46 places, 56 transitions, 455 flow [2022-12-06 05:44:49,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=46, PETRI_TRANSITIONS=56} [2022-12-06 05:44:49,766 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 05:44:49,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:49,766 INFO L89 Accepts]: Start accepts. Operand has 46 places, 56 transitions, 455 flow [2022-12-06 05:44:49,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:49,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:49,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 56 transitions, 455 flow [2022-12-06 05:44:49,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 56 transitions, 455 flow [2022-12-06 05:44:49,786 INFO L130 PetriNetUnfolder]: 42/138 cut-off events. [2022-12-06 05:44:49,787 INFO L131 PetriNetUnfolder]: For 181/185 co-relation queries the response was YES. [2022-12-06 05:44:49,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 138 events. 42/138 cut-off events. For 181/185 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 603 event pairs, 7 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 415. Up to 44 conditions per place. [2022-12-06 05:44:49,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 56 transitions, 455 flow [2022-12-06 05:44:49,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:44:49,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_120| v_~f~0.base_70))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_70 (* v_~x2~0_98 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_79|) (not (= (ite (and (< v_~x2~0_98 v_~size~0_84) (<= 0 v_~x2~0_98)) 1 0) 0)) (< 0 (* 2 (mod v_~n~0_80 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_84)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse1 (+ v_~f~0.offset_70 (* .cse0 4))) v_~x2~0_97)))) InVars {~x2~0=v_~x2~0_98, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, #memory_int=|v_#memory_int_120|, ~n~0=v_~n~0_80, ~f~0.offset=v_~f~0.offset_70} OutVars{~x2~0=v_~x2~0_97, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_35|, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_79|, ~f~0.offset=v_~f~0.offset_70, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|, #memory_int=|v_#memory_int_120|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_25|, ~n~0=v_~n~0_80, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:50,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:50,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 467 [2022-12-06 05:44:50,234 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 56 transitions, 465 flow [2022-12-06 05:44:50,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:50,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:50,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:50,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:44:50,234 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -110380839, now seen corresponding path program 2 times [2022-12-06 05:44:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697601261] [2022-12-06 05:44:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:50,321 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 05:44:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:50,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697601261] [2022-12-06 05:44:50,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697601261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:50,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622255256] [2022-12-06 05:44:50,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:44:50,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:50,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:50,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:50,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:44:50,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:44:50,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:44:50,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:44:50,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:50,507 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 05:44:50,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:50,538 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 05:44:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622255256] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:50,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:50,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 05:44:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549616884] [2022-12-06 05:44:50,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:50,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:50,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:44:50,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 56 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 05:44:50,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:50,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:44:50,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:50,696 INFO L130 PetriNetUnfolder]: 229/411 cut-off events. [2022-12-06 05:44:50,697 INFO L131 PetriNetUnfolder]: For 1062/1062 co-relation queries the response was YES. [2022-12-06 05:44:50,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 411 events. 229/411 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1599 event pairs, 91 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 1346. Up to 362 conditions per place. [2022-12-06 05:44:50,699 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 60 selfloop transitions, 8 changer transitions 2/70 dead transitions. [2022-12-06 05:44:50,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 677 flow [2022-12-06 05:44:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:44:50,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 05:44:50,700 INFO L175 Difference]: Start difference. First operand has 46 places, 56 transitions, 465 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:44:50,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 677 flow [2022-12-06 05:44:50,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 661 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:50,704 INFO L231 Difference]: Finished difference. Result has 49 places, 56 transitions, 473 flow [2022-12-06 05:44:50,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=49, PETRI_TRANSITIONS=56} [2022-12-06 05:44:50,705 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 05:44:50,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:50,705 INFO L89 Accepts]: Start accepts. Operand has 49 places, 56 transitions, 473 flow [2022-12-06 05:44:50,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:50,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:50,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 56 transitions, 473 flow [2022-12-06 05:44:50,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 56 transitions, 473 flow [2022-12-06 05:44:50,717 INFO L130 PetriNetUnfolder]: 44/148 cut-off events. [2022-12-06 05:44:50,717 INFO L131 PetriNetUnfolder]: For 227/233 co-relation queries the response was YES. [2022-12-06 05:44:50,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 148 events. 44/148 cut-off events. For 227/233 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 675 event pairs, 7 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 532. Up to 47 conditions per place. [2022-12-06 05:44:50,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 56 transitions, 473 flow [2022-12-06 05:44:50,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 05:44:50,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:44:50,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:50,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:44:50,883 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 56 transitions, 478 flow [2022-12-06 05:44:50,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 05:44:50,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:50,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:50,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:51,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 05:44:51,084 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2131638270, now seen corresponding path program 1 times [2022-12-06 05:44:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:51,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537012475] [2022-12-06 05:44:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:51,181 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 05:44:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:51,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537012475] [2022-12-06 05:44:51,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537012475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:51,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:51,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690023377] [2022-12-06 05:44:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:51,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:51,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:51,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:51,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:44:51,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 56 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:51,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:51,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:44:51,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:51,350 INFO L130 PetriNetUnfolder]: 239/431 cut-off events. [2022-12-06 05:44:51,350 INFO L131 PetriNetUnfolder]: For 1331/1331 co-relation queries the response was YES. [2022-12-06 05:44:51,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 431 events. 239/431 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1716 event pairs, 95 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 1849. Up to 376 conditions per place. [2022-12-06 05:44:51,353 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 61 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2022-12-06 05:44:51,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 692 flow [2022-12-06 05:44:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 05:44:51,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2022-12-06 05:44:51,354 INFO L175 Difference]: Start difference. First operand has 48 places, 56 transitions, 478 flow. Second operand 4 states and 49 transitions. [2022-12-06 05:44:51,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 692 flow [2022-12-06 05:44:51,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 660 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:51,358 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 483 flow [2022-12-06 05:44:51,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2022-12-06 05:44:51,358 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 05:44:51,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:51,358 INFO L89 Accepts]: Start accepts. Operand has 49 places, 57 transitions, 483 flow [2022-12-06 05:44:51,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:51,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:51,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 57 transitions, 483 flow [2022-12-06 05:44:51,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 57 transitions, 483 flow [2022-12-06 05:44:51,374 INFO L130 PetriNetUnfolder]: 46/156 cut-off events. [2022-12-06 05:44:51,374 INFO L131 PetriNetUnfolder]: For 315/319 co-relation queries the response was YES. [2022-12-06 05:44:51,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 156 events. 46/156 cut-off events. For 315/319 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 731 event pairs, 7 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 460. Up to 47 conditions per place. [2022-12-06 05:44:51,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 57 transitions, 483 flow [2022-12-06 05:44:51,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 05:44:51,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:51,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:51,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:44:51,531 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 492 flow [2022-12-06 05:44:51,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:51,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:51,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:51,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:44:51,532 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2077275410, now seen corresponding path program 1 times [2022-12-06 05:44:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:51,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041498833] [2022-12-06 05:44:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:51,639 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 05:44:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:51,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041498833] [2022-12-06 05:44:51,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041498833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:51,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:51,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32204375] [2022-12-06 05:44:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:51,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:51,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:44:51,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:51,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:51,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:44:51,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:51,743 INFO L130 PetriNetUnfolder]: 267/481 cut-off events. [2022-12-06 05:44:51,743 INFO L131 PetriNetUnfolder]: For 1680/1680 co-relation queries the response was YES. [2022-12-06 05:44:51,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 481 events. 267/481 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1986 event pairs, 112 based on Foata normal form. 4/468 useless extension candidates. Maximal degree in co-relation 1693. Up to 440 conditions per place. [2022-12-06 05:44:51,746 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 66 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-06 05:44:51,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 736 flow [2022-12-06 05:44:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:44:51,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 05:44:51,747 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 492 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:44:51,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 736 flow [2022-12-06 05:44:51,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 706 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:51,751 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 531 flow [2022-12-06 05:44:51,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2022-12-06 05:44:51,752 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2022-12-06 05:44:51,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:51,752 INFO L89 Accepts]: Start accepts. Operand has 52 places, 61 transitions, 531 flow [2022-12-06 05:44:51,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:51,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:51,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 61 transitions, 531 flow [2022-12-06 05:44:51,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 61 transitions, 531 flow [2022-12-06 05:44:51,765 INFO L130 PetriNetUnfolder]: 50/171 cut-off events. [2022-12-06 05:44:51,766 INFO L131 PetriNetUnfolder]: For 414/420 co-relation queries the response was YES. [2022-12-06 05:44:51,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 171 events. 50/171 cut-off events. For 414/420 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 844 event pairs, 8 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 598. Up to 53 conditions per place. [2022-12-06 05:44:51,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 61 transitions, 531 flow [2022-12-06 05:44:51,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 05:44:51,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:44:52,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:52,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-06 05:44:52,041 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 527 flow [2022-12-06 05:44:52,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:52,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:52,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:52,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:44:52,042 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1277806634, now seen corresponding path program 1 times [2022-12-06 05:44:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:52,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579246602] [2022-12-06 05:44:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:52,108 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 05:44:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:52,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579246602] [2022-12-06 05:44:52,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579246602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:52,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:52,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313045014] [2022-12-06 05:44:52,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:52,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:52,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:52,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:44:52,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:52,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:52,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:44:52,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:52,270 INFO L130 PetriNetUnfolder]: 311/562 cut-off events. [2022-12-06 05:44:52,270 INFO L131 PetriNetUnfolder]: For 2704/2704 co-relation queries the response was YES. [2022-12-06 05:44:52,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2889 conditions, 562 events. 311/562 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2419 event pairs, 101 based on Foata normal form. 19/562 useless extension candidates. Maximal degree in co-relation 2313. Up to 258 conditions per place. [2022-12-06 05:44:52,273 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 56 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2022-12-06 05:44:52,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 848 flow [2022-12-06 05:44:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 05:44:52,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 05:44:52,273 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 527 flow. Second operand 4 states and 57 transitions. [2022-12-06 05:44:52,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 848 flow [2022-12-06 05:44:52,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 822 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:52,280 INFO L231 Difference]: Finished difference. Result has 54 places, 62 transitions, 611 flow [2022-12-06 05:44:52,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=611, PETRI_PLACES=54, PETRI_TRANSITIONS=62} [2022-12-06 05:44:52,281 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:44:52,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:52,281 INFO L89 Accepts]: Start accepts. Operand has 54 places, 62 transitions, 611 flow [2022-12-06 05:44:52,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:52,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:52,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 62 transitions, 611 flow [2022-12-06 05:44:52,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 62 transitions, 611 flow [2022-12-06 05:44:52,301 INFO L130 PetriNetUnfolder]: 57/195 cut-off events. [2022-12-06 05:44:52,301 INFO L131 PetriNetUnfolder]: For 575/588 co-relation queries the response was YES. [2022-12-06 05:44:52,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 195 events. 57/195 cut-off events. For 575/588 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1009 event pairs, 10 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 708. Up to 66 conditions per place. [2022-12-06 05:44:52,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 62 transitions, 611 flow [2022-12-06 05:44:52,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 05:44:52,302 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:52,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:44:52,304 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 62 transitions, 611 flow [2022-12-06 05:44:52,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:52,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:52,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:52,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:44:52,304 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:52,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash -157582306, now seen corresponding path program 1 times [2022-12-06 05:44:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:52,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79906360] [2022-12-06 05:44:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:52,370 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 05:44:52,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:52,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79906360] [2022-12-06 05:44:52,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79906360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:52,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:52,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825509593] [2022-12-06 05:44:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:52,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:52,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:52,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:52,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:52,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:44:52,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 62 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:52,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:52,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:44:52,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:52,496 INFO L130 PetriNetUnfolder]: 317/572 cut-off events. [2022-12-06 05:44:52,497 INFO L131 PetriNetUnfolder]: For 2937/2937 co-relation queries the response was YES. [2022-12-06 05:44:52,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 572 events. 317/572 cut-off events. For 2937/2937 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2452 event pairs, 148 based on Foata normal form. 4/561 useless extension candidates. Maximal degree in co-relation 2572. Up to 523 conditions per place. [2022-12-06 05:44:52,500 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 71 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2022-12-06 05:44:52,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 875 flow [2022-12-06 05:44:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 05:44:52,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 05:44:52,501 INFO L175 Difference]: Start difference. First operand has 54 places, 62 transitions, 611 flow. Second operand 4 states and 49 transitions. [2022-12-06 05:44:52,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 875 flow [2022-12-06 05:44:52,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 859 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-06 05:44:52,509 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 636 flow [2022-12-06 05:44:52,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=636, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2022-12-06 05:44:52,510 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 05:44:52,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:52,510 INFO L89 Accepts]: Start accepts. Operand has 58 places, 63 transitions, 636 flow [2022-12-06 05:44:52,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:52,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:52,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 63 transitions, 636 flow [2022-12-06 05:44:52,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 63 transitions, 636 flow [2022-12-06 05:44:52,527 INFO L130 PetriNetUnfolder]: 58/197 cut-off events. [2022-12-06 05:44:52,527 INFO L131 PetriNetUnfolder]: For 760/774 co-relation queries the response was YES. [2022-12-06 05:44:52,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 197 events. 58/197 cut-off events. For 760/774 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1023 event pairs, 10 based on Foata normal form. 2/186 useless extension candidates. Maximal degree in co-relation 750. Up to 68 conditions per place. [2022-12-06 05:44:52,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 63 transitions, 636 flow [2022-12-06 05:44:52,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 05:44:52,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_203| v_~f~0.base_126))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_126 (* v_~x2~0_137 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_126 (* 4 .cse3))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_126 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= (select .cse0 (+ v_~f~0.offset_126 (* .cse1 4))) v_~x2~0_135) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_135 2147483648) 2)) (not (= 0 (ite (and (< v_~x2~0_137 v_~size~0_136) (<= 0 v_~x2~0_137)) 1 0))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (< .cse2 v_~size~0_136) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_136)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_135, ~f~0.offset=v_~f~0.offset_126} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_126, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_203|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_135, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [631] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_209| v_~f~0.base_132))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_132 (* v_~x2~0_151 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_132 (* v_~x1~0_203 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (not (= (ite (and (< v_~x1~0_203 v_~size~0_142) (<= 0 v_~x1~0_203)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_142) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= |v_thread2Thread1of1ForFork1_~i~1#1_116| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_117|)) (= v_~x2~0_150 (select .cse1 (+ (* .cse0 4) v_~f~0.offset_132))) (= |v_thread1Thread1of1ForFork0_~i~0#1_164| 2) (not (= (ite (and (<= 0 v_~x2~0_151) (< v_~x2~0_151 v_~size~0_142)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_142)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= v_~x1~0_202 (select .cse1 (+ v_~f~0.offset_132 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_117| 4294967296) (* 2 (mod v_~n~0_141 2147483648)))))) InVars {~x2~0=v_~x2~0_151, ~size~0=v_~size~0_142, ~f~0.base=v_~f~0.base_132, #memory_int=|v_#memory_int_209|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_117|, ~n~0=v_~n~0_141, ~x1~0=v_~x1~0_203, ~f~0.offset=v_~f~0.offset_132} OutVars{~x2~0=v_~x2~0_150, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_112|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_142, ~f~0.base=v_~f~0.base_132, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_116|, ~x1~0=v_~x1~0_202, ~f~0.offset=v_~f~0.offset_132, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_164|, #memory_int=|v_#memory_int_209|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ~n~0=v_~n~0_141, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_53|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_120|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:52,959 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:52,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 450 [2022-12-06 05:44:52,960 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 641 flow [2022-12-06 05:44:52,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:52,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:52,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:52,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:44:52,960 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:52,961 INFO L85 PathProgramCache]: Analyzing trace with hash -616105078, now seen corresponding path program 2 times [2022-12-06 05:44:52,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:52,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538964581] [2022-12-06 05:44:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:53,068 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 05:44:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:53,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538964581] [2022-12-06 05:44:53,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538964581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:53,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:53,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535546575] [2022-12-06 05:44:53,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:53,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:53,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:53,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:44:53,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 641 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:53,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:53,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:44:53,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:53,271 INFO L130 PetriNetUnfolder]: 302/537 cut-off events. [2022-12-06 05:44:53,271 INFO L131 PetriNetUnfolder]: For 3290/3290 co-relation queries the response was YES. [2022-12-06 05:44:53,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 537 events. 302/537 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2218 event pairs, 142 based on Foata normal form. 6/528 useless extension candidates. Maximal degree in co-relation 2351. Up to 512 conditions per place. [2022-12-06 05:44:53,274 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 57 selfloop transitions, 7 changer transitions 8/72 dead transitions. [2022-12-06 05:44:53,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 837 flow [2022-12-06 05:44:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:44:53,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-06 05:44:53,275 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 641 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:44:53,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 837 flow [2022-12-06 05:44:53,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 801 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:53,280 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 630 flow [2022-12-06 05:44:53,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=630, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2022-12-06 05:44:53,280 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 39 predicate places. [2022-12-06 05:44:53,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:53,281 INFO L89 Accepts]: Start accepts. Operand has 60 places, 63 transitions, 630 flow [2022-12-06 05:44:53,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:53,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:53,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 630 flow [2022-12-06 05:44:53,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 630 flow [2022-12-06 05:44:53,312 INFO L130 PetriNetUnfolder]: 55/176 cut-off events. [2022-12-06 05:44:53,312 INFO L131 PetriNetUnfolder]: For 786/815 co-relation queries the response was YES. [2022-12-06 05:44:53,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 176 events. 55/176 cut-off events. For 786/815 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 850 event pairs, 9 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 726. Up to 65 conditions per place. [2022-12-06 05:44:53,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 630 flow [2022-12-06 05:44:53,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 05:44:53,314 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:53,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:44:53,315 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 630 flow [2022-12-06 05:44:53,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:53,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:53,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:53,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:44:53,315 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1235189396, now seen corresponding path program 1 times [2022-12-06 05:44:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:53,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034065165] [2022-12-06 05:44:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:53,503 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 05:44:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:53,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034065165] [2022-12-06 05:44:53,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034065165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:53,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386607707] [2022-12-06 05:44:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:53,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:53,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:53,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:53,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:44:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:53,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 05:44:53,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:53,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:53,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:44:53,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:53,659 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 05:44:53,664 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 05:44:53,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:53,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:53,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-06 05:44:53,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:53,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-06 05:44:53,844 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 05:44:53,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386607707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:53,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:53,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:44:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382874993] [2022-12-06 05:44:53,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:53,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:44:53,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:44:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:44:53,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:44:53,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 630 flow. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 05:44:53,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:53,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:44:53,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:54,116 INFO L130 PetriNetUnfolder]: 364/645 cut-off events. [2022-12-06 05:44:54,117 INFO L131 PetriNetUnfolder]: For 3708/3708 co-relation queries the response was YES. [2022-12-06 05:44:54,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 645 events. 364/645 cut-off events. For 3708/3708 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2814 event pairs, 43 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 3236. Up to 370 conditions per place. [2022-12-06 05:44:54,121 INFO L137 encePairwiseOnDemand]: 12/35 looper letters, 63 selfloop transitions, 47 changer transitions 1/111 dead transitions. [2022-12-06 05:44:54,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 1205 flow [2022-12-06 05:44:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:44:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:44:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2022-12-06 05:44:54,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27936507936507937 [2022-12-06 05:44:54,122 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 630 flow. Second operand 9 states and 88 transitions. [2022-12-06 05:44:54,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 1205 flow [2022-12-06 05:44:54,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 1149 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:54,131 INFO L231 Difference]: Finished difference. Result has 67 places, 78 transitions, 923 flow [2022-12-06 05:44:54,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=923, PETRI_PLACES=67, PETRI_TRANSITIONS=78} [2022-12-06 05:44:54,131 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-06 05:44:54,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:54,131 INFO L89 Accepts]: Start accepts. Operand has 67 places, 78 transitions, 923 flow [2022-12-06 05:44:54,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:54,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:54,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 78 transitions, 923 flow [2022-12-06 05:44:54,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 78 transitions, 923 flow [2022-12-06 05:44:54,151 INFO L130 PetriNetUnfolder]: 64/214 cut-off events. [2022-12-06 05:44:54,151 INFO L131 PetriNetUnfolder]: For 935/964 co-relation queries the response was YES. [2022-12-06 05:44:54,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 214 events. 64/214 cut-off events. For 935/964 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1132 event pairs, 11 based on Foata normal form. 3/204 useless extension candidates. Maximal degree in co-relation 945. Up to 75 conditions per place. [2022-12-06 05:44:54,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 78 transitions, 923 flow [2022-12-06 05:44:54,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 05:44:54,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_106| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (= (ite (and (<= 0 v_~x1~0_119) (< v_~x1~0_119 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_52| |v_#pthreadsForks_64|) (= (store |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_52|)) |v_#memory_int_159|) (= v_~x1~0_118 (select (select |v_#memory_int_160| v_~f~0.base_94) (+ v_~f~0.offset_94 (* v_~x1~0_119 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_106| 4294967295) 4294967296) (* 2 (mod v_~n~0_105 2147483648))) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|)) InVars {#pthreadsForks=|v_#pthreadsForks_64|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, #memory_int=|v_#memory_int_160|, ~n~0=v_~n~0_105, ~x1~0=v_~x1~0_119, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ~f~0.offset=v_~f~0.offset_94} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, ~x1~0=v_~x1~0_118, ~f~0.offset=v_~f~0.offset_94, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_52|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_41|, #pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_55|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_159|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, ~n~0=v_~n~0_105, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:54,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:44:54,460 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:54,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 330 [2022-12-06 05:44:54,461 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 78 transitions, 943 flow [2022-12-06 05:44:54,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 05:44:54,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:54,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:54,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:44:54,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 05:44:54,676 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash -49574454, now seen corresponding path program 2 times [2022-12-06 05:44:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:54,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991144891] [2022-12-06 05:44:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:55,179 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 05:44:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:55,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991144891] [2022-12-06 05:44:55,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991144891] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:55,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225624999] [2022-12-06 05:44:55,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:44:55,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:55,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:55,181 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:55,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:44:55,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:44:55,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:44:55,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 05:44:55,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:55,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:55,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:44:55,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:44:55,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:55,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:44:55,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:55,397 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 26 [2022-12-06 05:44:55,406 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 05:44:55,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:55,483 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 05:44:55,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225624999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:55,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:55,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:44:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393990223] [2022-12-06 05:44:55,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:55,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:44:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:44:55,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:44:55,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:44:55,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 78 transitions, 943 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:44:55,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:55,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:44:55,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:55,947 INFO L130 PetriNetUnfolder]: 446/793 cut-off events. [2022-12-06 05:44:55,948 INFO L131 PetriNetUnfolder]: For 5201/5201 co-relation queries the response was YES. [2022-12-06 05:44:55,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4631 conditions, 793 events. 446/793 cut-off events. For 5201/5201 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3695 event pairs, 120 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 4248. Up to 641 conditions per place. [2022-12-06 05:44:55,953 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 90 selfloop transitions, 37 changer transitions 1/128 dead transitions. [2022-12-06 05:44:55,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 1582 flow [2022-12-06 05:44:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:44:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:44:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-12-06 05:44:55,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23783783783783785 [2022-12-06 05:44:55,954 INFO L175 Difference]: Start difference. First operand has 67 places, 78 transitions, 943 flow. Second operand 10 states and 88 transitions. [2022-12-06 05:44:55,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 1582 flow [2022-12-06 05:44:55,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 128 transitions, 1479 flow, removed 35 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:55,964 INFO L231 Difference]: Finished difference. Result has 78 places, 97 transitions, 1215 flow [2022-12-06 05:44:55,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1215, PETRI_PLACES=78, PETRI_TRANSITIONS=97} [2022-12-06 05:44:55,964 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 57 predicate places. [2022-12-06 05:44:55,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:55,964 INFO L89 Accepts]: Start accepts. Operand has 78 places, 97 transitions, 1215 flow [2022-12-06 05:44:55,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:55,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:55,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 97 transitions, 1215 flow [2022-12-06 05:44:55,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 97 transitions, 1215 flow [2022-12-06 05:44:55,986 INFO L130 PetriNetUnfolder]: 78/264 cut-off events. [2022-12-06 05:44:55,987 INFO L131 PetriNetUnfolder]: For 1178/1217 co-relation queries the response was YES. [2022-12-06 05:44:55,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 264 events. 78/264 cut-off events. For 1178/1217 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1520 event pairs, 14 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 1209. Up to 93 conditions per place. [2022-12-06 05:44:55,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 97 transitions, 1215 flow [2022-12-06 05:44:55,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 05:44:56,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_203| v_~f~0.base_126))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_126 (* v_~x2~0_137 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_126 (* 4 .cse3))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_126 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= (select .cse0 (+ v_~f~0.offset_126 (* .cse1 4))) v_~x2~0_135) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_135 2147483648) 2)) (not (= 0 (ite (and (< v_~x2~0_137 v_~size~0_136) (<= 0 v_~x2~0_137)) 1 0))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (< .cse2 v_~size~0_136) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_136)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_135, ~f~0.offset=v_~f~0.offset_126} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_126, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_203|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_135, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [633] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_211| v_~f~0.base_134))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_134 (* v_~x1~0_208 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_134 (* .cse2 4))))) (and (= v_~x1~0_206 (select .cse0 (+ v_~f~0.offset_134 (* 4 .cse1)))) (not (= (ite (and (<= 0 v_~x1~0_208) (< v_~x1~0_208 v_~size~0_144)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_166| 3) (< 2 (* (mod v_~n~0_143 2147483648) 2)) (= (ite (and (< .cse1 v_~size~0_144) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_144)) 1 0) 0)))))) InVars {~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_134, #memory_int=|v_#memory_int_211|, ~n~0=v_~n~0_143, ~x1~0=v_~x1~0_208, ~f~0.offset=v_~f~0.offset_134} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|, ~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_134, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112|, #memory_int=|v_#memory_int_211|, ~n~0=v_~n~0_143, ~x1~0=v_~x1~0_206, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_122|, ~f~0.offset=v_~f~0.offset_134} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:56,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_213| v_~f~0.base_136))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_136 (* v_~x2~0_156 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_136 (* 4 .cse6))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_136 (* .cse2 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_136 (* 4 .cse5))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_136 (* v_~x1~0_213 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_136 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (not (= (ite (and (<= 0 v_~x2~0_156) (< v_~x2~0_156 v_~size~0_146)) 1 0) 0)) (= v_~x1~0_212 (select .cse0 (+ v_~f~0.offset_136 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x1~0_213) (< v_~x1~0_213 v_~size~0_146)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_146)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_170| 2) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_120|) 4294967296) (* 2 (mod v_~n~0_145 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_146) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_146)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_136 (* .cse4 4))) v_~x2~0_154) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_146)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= 0 (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_146)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_146)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116| 0))))))))) InVars {~x2~0=v_~x2~0_156, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_136, #memory_int=|v_#memory_int_213|, ~n~0=v_~n~0_145, ~x1~0=v_~x1~0_213, ~f~0.offset=v_~f~0.offset_136} OutVars{~x2~0=v_~x2~0_154, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_118|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_136, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_136, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_170|, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_145, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_126|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:44:56,947 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:56,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 984 [2022-12-06 05:44:56,948 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 97 transitions, 1239 flow [2022-12-06 05:44:56,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:44:56,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:56,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:56,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:57,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:57,153 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash -712213236, now seen corresponding path program 1 times [2022-12-06 05:44:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:57,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80768575] [2022-12-06 05:44:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:57,566 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 05:44:57,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:57,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80768575] [2022-12-06 05:44:57,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80768575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:57,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:57,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733918868] [2022-12-06 05:44:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:57,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:57,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:57,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:57,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:44:57,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 97 transitions, 1239 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:57,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:57,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:44:57,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:57,819 INFO L130 PetriNetUnfolder]: 508/902 cut-off events. [2022-12-06 05:44:57,819 INFO L131 PetriNetUnfolder]: For 6414/6414 co-relation queries the response was YES. [2022-12-06 05:44:57,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5382 conditions, 902 events. 508/902 cut-off events. For 6414/6414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4362 event pairs, 129 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 4721. Up to 770 conditions per place. [2022-12-06 05:44:57,826 INFO L137 encePairwiseOnDemand]: 13/39 looper letters, 84 selfloop transitions, 36 changer transitions 2/122 dead transitions. [2022-12-06 05:44:57,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 1708 flow [2022-12-06 05:44:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 05:44:57,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3282051282051282 [2022-12-06 05:44:57,827 INFO L175 Difference]: Start difference. First operand has 78 places, 97 transitions, 1239 flow. Second operand 5 states and 64 transitions. [2022-12-06 05:44:57,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 1708 flow [2022-12-06 05:44:57,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 1576 flow, removed 60 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:57,841 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1377 flow [2022-12-06 05:44:57,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1377, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2022-12-06 05:44:57,841 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 05:44:57,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:57,841 INFO L89 Accepts]: Start accepts. Operand has 83 places, 106 transitions, 1377 flow [2022-12-06 05:44:57,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:57,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:57,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 106 transitions, 1377 flow [2022-12-06 05:44:57,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 106 transitions, 1377 flow [2022-12-06 05:44:57,867 INFO L130 PetriNetUnfolder]: 87/297 cut-off events. [2022-12-06 05:44:57,867 INFO L131 PetriNetUnfolder]: For 1543/1592 co-relation queries the response was YES. [2022-12-06 05:44:57,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 297 events. 87/297 cut-off events. For 1543/1592 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1803 event pairs, 17 based on Foata normal form. 4/281 useless extension candidates. Maximal degree in co-relation 1454. Up to 81 conditions per place. [2022-12-06 05:44:57,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 106 transitions, 1377 flow [2022-12-06 05:44:57,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 05:44:57,870 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:57,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:44:57,871 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 1377 flow [2022-12-06 05:44:57,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:44:57,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:57,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:57,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:44:57,872 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2049019939, now seen corresponding path program 1 times [2022-12-06 05:44:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:57,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113775139] [2022-12-06 05:44:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:59,540 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 05:44:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:59,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113775139] [2022-12-06 05:44:59,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113775139] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:59,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713560515] [2022-12-06 05:44:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:59,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:59,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:59,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:59,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:44:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:59,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:44:59,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:59,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:59,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 05:44:59,744 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 05:44:59,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:00,067 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 05:45:00,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 05:45:01,044 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 05:45:01,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713560515] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:01,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:01,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 05:45:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306231417] [2022-12-06 05:45:01,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:01,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:45:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:45:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:45:01,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:45:01,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 1377 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:45:01,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:01,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:45:01,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:01,321 INFO L130 PetriNetUnfolder]: 566/1003 cut-off events. [2022-12-06 05:45:01,321 INFO L131 PetriNetUnfolder]: For 7741/7741 co-relation queries the response was YES. [2022-12-06 05:45:01,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 1003 events. 566/1003 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4974 event pairs, 193 based on Foata normal form. 2/997 useless extension candidates. Maximal degree in co-relation 5769. Up to 872 conditions per place. [2022-12-06 05:45:01,328 INFO L137 encePairwiseOnDemand]: 15/38 looper letters, 92 selfloop transitions, 39 changer transitions 1/132 dead transitions. [2022-12-06 05:45:01,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 132 transitions, 1862 flow [2022-12-06 05:45:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:45:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:45:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-06 05:45:01,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22932330827067668 [2022-12-06 05:45:01,329 INFO L175 Difference]: Start difference. First operand has 82 places, 106 transitions, 1377 flow. Second operand 7 states and 61 transitions. [2022-12-06 05:45:01,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 132 transitions, 1862 flow [2022-12-06 05:45:01,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 132 transitions, 1831 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:01,345 INFO L231 Difference]: Finished difference. Result has 88 places, 118 transitions, 1649 flow [2022-12-06 05:45:01,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1649, PETRI_PLACES=88, PETRI_TRANSITIONS=118} [2022-12-06 05:45:01,345 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 67 predicate places. [2022-12-06 05:45:01,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:01,345 INFO L89 Accepts]: Start accepts. Operand has 88 places, 118 transitions, 1649 flow [2022-12-06 05:45:01,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:01,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:01,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 118 transitions, 1649 flow [2022-12-06 05:45:01,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 118 transitions, 1649 flow [2022-12-06 05:45:01,399 INFO L130 PetriNetUnfolder]: 95/327 cut-off events. [2022-12-06 05:45:01,399 INFO L131 PetriNetUnfolder]: For 1882/1944 co-relation queries the response was YES. [2022-12-06 05:45:01,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 327 events. 95/327 cut-off events. For 1882/1944 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2076 event pairs, 20 based on Foata normal form. 4/308 useless extension candidates. Maximal degree in co-relation 1561. Up to 92 conditions per place. [2022-12-06 05:45:01,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 118 transitions, 1649 flow [2022-12-06 05:45:01,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 05:45:01,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_228| v_~f~0.base_144))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_175 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_235 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_144 (* .cse5 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_144 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|) (= |v_thread2Thread1of1ForFork1_~i~1#1_136| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x1~0_235 v_~size~0_154) (<= 0 v_~x1~0_235)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_175 v_~size~0_154) (<= 0 v_~x2~0_175)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x2~0_174) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130| 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_154) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< .cse3 v_~size~0_154) (<= 0 .cse3)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse4 4))) v_~x1~0_234) (= |v_thread1Thread1of1ForFork0_~i~0#1_186| 3) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_154)) 1 0) 0)) (= (ite (and (< .cse4 v_~size~0_154) (<= 0 .cse4)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_154)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (< 2 (* (mod v_~n~0_153 2147483648) 2))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_154, ~f~0.base=v_~f~0.base_144, #memory_int=|v_#memory_int_228|, ~n~0=v_~n~0_153, ~x1~0=v_~x1~0_235, ~f~0.offset=v_~f~0.offset_144} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_132|, ~x2~0=v_~x2~0_174, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_79|, ~size~0=v_~size~0_154, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_136|, ~x1~0=v_~x1~0_234, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_186|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|, #memory_int=|v_#memory_int_228|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_69|, ~n~0=v_~n~0_153, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_140|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_69|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:03,337 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:03,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1992 [2022-12-06 05:45:03,337 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 118 transitions, 1673 flow [2022-12-06 05:45:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:45:03,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:03,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:03,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:03,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:03,538 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:03,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1451375644, now seen corresponding path program 1 times [2022-12-06 05:45:03,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:03,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154198088] [2022-12-06 05:45:03,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:03,602 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 05:45:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:03,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154198088] [2022-12-06 05:45:03,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154198088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:03,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:03,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466106323] [2022-12-06 05:45:03,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:03,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:03,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:03,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:03,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:45:03,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 118 transitions, 1673 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:03,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:03,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:45:03,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:03,928 INFO L130 PetriNetUnfolder]: 698/1241 cut-off events. [2022-12-06 05:45:03,928 INFO L131 PetriNetUnfolder]: For 10311/10311 co-relation queries the response was YES. [2022-12-06 05:45:03,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 1241 events. 698/1241 cut-off events. For 10311/10311 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6466 event pairs, 310 based on Foata normal form. 8/1241 useless extension candidates. Maximal degree in co-relation 7072. Up to 960 conditions per place. [2022-12-06 05:45:03,944 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 142 selfloop transitions, 14 changer transitions 0/156 dead transitions. [2022-12-06 05:45:03,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 156 transitions, 2422 flow [2022-12-06 05:45:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 05:45:03,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 05:45:03,946 INFO L175 Difference]: Start difference. First operand has 88 places, 118 transitions, 1673 flow. Second operand 6 states and 70 transitions. [2022-12-06 05:45:03,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 156 transitions, 2422 flow [2022-12-06 05:45:03,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 156 transitions, 2346 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:03,968 INFO L231 Difference]: Finished difference. Result has 94 places, 125 transitions, 1776 flow [2022-12-06 05:45:03,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1776, PETRI_PLACES=94, PETRI_TRANSITIONS=125} [2022-12-06 05:45:03,969 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 05:45:03,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:03,969 INFO L89 Accepts]: Start accepts. Operand has 94 places, 125 transitions, 1776 flow [2022-12-06 05:45:03,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:03,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:03,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 125 transitions, 1776 flow [2022-12-06 05:45:03,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 125 transitions, 1776 flow [2022-12-06 05:45:04,004 INFO L130 PetriNetUnfolder]: 119/404 cut-off events. [2022-12-06 05:45:04,004 INFO L131 PetriNetUnfolder]: For 3327/3412 co-relation queries the response was YES. [2022-12-06 05:45:04,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2323 conditions, 404 events. 119/404 cut-off events. For 3327/3412 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2698 event pairs, 27 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 2115. Up to 117 conditions per place. [2022-12-06 05:45:04,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 125 transitions, 1776 flow [2022-12-06 05:45:04,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 05:45:04,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:45:04,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:45:04,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:04,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-06 05:45:04,399 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 125 transitions, 1772 flow [2022-12-06 05:45:04,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:04,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:04,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:04,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:45:04,399 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:04,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1288017019, now seen corresponding path program 1 times [2022-12-06 05:45:04,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:04,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928717879] [2022-12-06 05:45:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:04,498 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 05:45:04,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:04,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928717879] [2022-12-06 05:45:04,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928717879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:04,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336579636] [2022-12-06 05:45:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:04,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:04,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:04,521 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:04,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:45:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:04,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 05:45:04,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:04,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:04,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:45:04,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:04,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:04,756 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 05:45:04,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 64 [2022-12-06 05:45:04,785 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 05:45:04,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:07,123 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 05:45:07,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336579636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:07,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:07,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 05:45:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154781358] [2022-12-06 05:45:07,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:07,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:45:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:07,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:45:07,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=115, Unknown=4, NotChecked=0, Total=156 [2022-12-06 05:45:07,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:45:07,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 125 transitions, 1772 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:45:07,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:07,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:45:07,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:17,391 WARN L233 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:45:27,948 WARN L233 SmtUtils]: Spent 10.32s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:45:38,429 WARN L233 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:45:39,469 INFO L130 PetriNetUnfolder]: 774/1381 cut-off events. [2022-12-06 05:45:39,470 INFO L131 PetriNetUnfolder]: For 14306/14306 co-relation queries the response was YES. [2022-12-06 05:45:39,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9042 conditions, 1381 events. 774/1381 cut-off events. For 14306/14306 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7424 event pairs, 154 based on Foata normal form. 14/1387 useless extension candidates. Maximal degree in co-relation 8386. Up to 1068 conditions per place. [2022-12-06 05:45:39,488 INFO L137 encePairwiseOnDemand]: 13/42 looper letters, 113 selfloop transitions, 60 changer transitions 9/182 dead transitions. [2022-12-06 05:45:39,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 182 transitions, 2630 flow [2022-12-06 05:45:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:45:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:45:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 116 transitions. [2022-12-06 05:45:39,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17261904761904762 [2022-12-06 05:45:39,489 INFO L175 Difference]: Start difference. First operand has 95 places, 125 transitions, 1772 flow. Second operand 16 states and 116 transitions. [2022-12-06 05:45:39,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 182 transitions, 2630 flow [2022-12-06 05:45:39,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 182 transitions, 2582 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-06 05:45:39,520 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 2036 flow [2022-12-06 05:45:39,520 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2036, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2022-12-06 05:45:39,521 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 05:45:39,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:39,522 INFO L89 Accepts]: Start accepts. Operand has 113 places, 131 transitions, 2036 flow [2022-12-06 05:45:39,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:39,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:39,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 131 transitions, 2036 flow [2022-12-06 05:45:39,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 131 transitions, 2036 flow [2022-12-06 05:45:39,558 INFO L130 PetriNetUnfolder]: 128/434 cut-off events. [2022-12-06 05:45:39,559 INFO L131 PetriNetUnfolder]: For 4963/5053 co-relation queries the response was YES. [2022-12-06 05:45:39,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 434 events. 128/434 cut-off events. For 4963/5053 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2948 event pairs, 29 based on Foata normal form. 4/405 useless extension candidates. Maximal degree in co-relation 2533. Up to 126 conditions per place. [2022-12-06 05:45:39,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 131 transitions, 2036 flow [2022-12-06 05:45:39,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 05:45:39,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:45:40,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_230| v_~f~0.base_146))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_146 (* v_~x2~0_179 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_146 (* 4 .cse6))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_146 (* .cse7 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_146 (* .cse0 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_146 (* v_~x1~0_240 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_146 (* .cse5 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_146 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_156)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_146 (* .cse2 4))) v_~x2~0_178) (not (= (ite (and (< v_~x1~0_240 v_~size~0_156) (<= 0 v_~x1~0_240)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_156)) 1 0) 0)) (= v_~x1~0_238 (select .cse1 (+ v_~f~0.offset_146 (* .cse4 4)))) (not (= (ite (and (< .cse5 v_~size~0_156) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_156)) 1 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_138|) (= |v_thread1Thread1of1ForFork0_~i~0#1_188| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_156)) 1 0))) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_156)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_138|) 4294967296) (* (mod v_~n~0_155 2147483648) 2)) (not (= (ite (and (<= 0 v_~x2~0_179) (< v_~x2~0_179 v_~size~0_156)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_156)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_179, ~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_146, #memory_int=|v_#memory_int_230|, ~n~0=v_~n~0_155, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_146} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_134|, ~x2~0=v_~x2~0_178, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_146, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_85|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_138|, ~x1~0=v_~x1~0_238, ~f~0.offset=v_~f~0.offset_146, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_188|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|, #memory_int=|v_#memory_int_230|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_71|, ~n~0=v_~n~0_155, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_142|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:41,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_250| v_~f~0.base_160))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_160 (* v_~x2~0_203 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_160 (* v_~x1~0_274 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_160 (* .cse4 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_160 (* .cse5 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_160 (* .cse2 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_168)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_168)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread2Thread1of1ForFork1_~i~1#1_156| 4) (not (= (ite (and (< .cse2 v_~size~0_168) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_202 (select .cse3 (+ v_~f~0.offset_160 (* .cse1 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_212| 4294967295) 4294967296) (* (mod v_~n~0_167 2147483648) 2)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_168)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_274 v_~size~0_168) (<= 0 v_~x1~0_274)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_212| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152| 0)) (not (= (ite (and (< .cse5 v_~size~0_168) (<= 0 .cse5)) 1 0) 0)) (= v_~x1~0_272 (select .cse3 (+ v_~f~0.offset_160 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_203) (< v_~x2~0_203 v_~size~0_168)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_168)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_203, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_160, #memory_int=|v_#memory_int_250|, ~n~0=v_~n~0_167, ~x1~0=v_~x1~0_274, ~f~0.offset=v_~f~0.offset_160} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_154|, ~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_99|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_156|, ~x1~0=v_~x1~0_272, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_212|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|, #memory_int=|v_#memory_int_250|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_85|, ~n~0=v_~n~0_167, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_162|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_85|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:42,234 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:45:42,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2714 [2022-12-06 05:45:42,235 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 129 transitions, 2081 flow [2022-12-06 05:45:42,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:45:42,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:42,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:42,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 05:45:42,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 05:45:42,436 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash 149813494, now seen corresponding path program 1 times [2022-12-06 05:45:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:42,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037823598] [2022-12-06 05:45:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:42,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:42,514 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 05:45:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037823598] [2022-12-06 05:45:42,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037823598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:42,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:42,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185484866] [2022-12-06 05:45:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:42,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:42,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:42,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:42,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:45:42,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 129 transitions, 2081 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:42,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:42,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:45:42,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:42,862 INFO L130 PetriNetUnfolder]: 770/1422 cut-off events. [2022-12-06 05:45:42,862 INFO L131 PetriNetUnfolder]: For 19065/19065 co-relation queries the response was YES. [2022-12-06 05:45:42,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9797 conditions, 1422 events. 770/1422 cut-off events. For 19065/19065 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8165 event pairs, 292 based on Foata normal form. 24/1438 useless extension candidates. Maximal degree in co-relation 9098. Up to 1052 conditions per place. [2022-12-06 05:45:42,871 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 125 selfloop transitions, 31 changer transitions 7/163 dead transitions. [2022-12-06 05:45:42,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 163 transitions, 2763 flow [2022-12-06 05:45:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:45:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:45:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 05:45:42,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32272727272727275 [2022-12-06 05:45:42,873 INFO L175 Difference]: Start difference. First operand has 108 places, 129 transitions, 2081 flow. Second operand 5 states and 71 transitions. [2022-12-06 05:45:42,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 163 transitions, 2763 flow [2022-12-06 05:45:42,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 163 transitions, 2498 flow, removed 114 selfloop flow, removed 6 redundant places. [2022-12-06 05:45:42,908 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1977 flow [2022-12-06 05:45:42,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1977, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 05:45:42,909 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 05:45:42,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:42,909 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1977 flow [2022-12-06 05:45:42,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:42,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:42,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1977 flow [2022-12-06 05:45:42,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1977 flow [2022-12-06 05:45:42,947 INFO L130 PetriNetUnfolder]: 130/451 cut-off events. [2022-12-06 05:45:42,948 INFO L131 PetriNetUnfolder]: For 5204/5258 co-relation queries the response was YES. [2022-12-06 05:45:42,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 451 events. 130/451 cut-off events. For 5204/5258 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3155 event pairs, 30 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2662. Up to 137 conditions per place. [2022-12-06 05:45:42,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1977 flow [2022-12-06 05:45:42,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 05:45:43,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_233| v_~f~0.base_148))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_148 (* v_~x2~0_186 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_148 (* 4 .cse4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_148 (* .cse6 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_148 (* .cse5 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_148 (* v_~x1~0_249 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_148 (* .cse7 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_148 (* .cse2 4))))) (and (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_142|) 4294967296) (* (mod v_~n~0_157 2147483648) 2)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_142|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (= (select .cse0 (+ v_~f~0.offset_148 (* 4 .cse1))) v_~x2~0_184) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_158)) 1 0) 0)) (= v_~x1~0_248 (select .cse0 (+ v_~f~0.offset_148 (* .cse3 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| (ite (and (< .cse3 v_~size~0_158) (<= 0 .cse3)) 1 0)) (not (= (ite (and (< .cse4 v_~size~0_158) (<= 0 .cse4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| 3) (not (= (ite (and (< .cse5 v_~size~0_158) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= (ite (and (< v_~x1~0_249 v_~size~0_158) (<= 0 v_~x1~0_249)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_158)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_158)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_186) (< v_~x2~0_186 v_~size~0_158)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_186, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_148, #memory_int=|v_#memory_int_233|, ~n~0=v_~n~0_157, ~x1~0=v_~x1~0_249, ~f~0.offset=v_~f~0.offset_148} OutVars{~x2~0=v_~x2~0_184, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_141|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_148, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_89|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_142|, ~x1~0=v_~x1~0_248, ~f~0.offset=v_~f~0.offset_148, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_75|, ~n~0=v_~n~0_157, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_75|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_149|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:45:44,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:44,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_169| v_~f~0.base_102))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_102 (* v_~x1~0_142 4))))) (and (not (= (ite (and (< v_~x1~0_142 v_~size~0_114) (<= 0 v_~x1~0_142)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_124| 4294967295) 4294967296) (* (mod v_~n~0_113 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= v_~x1~0_140 (select .cse0 (+ v_~f~0.offset_102 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= |v_thread1Thread1of1ForFork0_~i~0#1_124| 2)))) InVars {~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_102, #memory_int=|v_#memory_int_169|, ~n~0=v_~n~0_113, ~x1~0=v_~x1~0_142, ~f~0.offset=v_~f~0.offset_102} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_76|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_102, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_124|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74|, #memory_int=|v_#memory_int_169|, ~n~0=v_~n~0_113, ~x1~0=v_~x1~0_140, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_84|, ~f~0.offset=v_~f~0.offset_102} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:44,694 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:45:44,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1786 [2022-12-06 05:45:44,695 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 2027 flow [2022-12-06 05:45:44,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:44,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:44,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:44,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:45:44,695 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1625893549, now seen corresponding path program 1 times [2022-12-06 05:45:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:44,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060986729] [2022-12-06 05:45:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:44,800 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 05:45:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060986729] [2022-12-06 05:45:44,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060986729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:44,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:44,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688997242] [2022-12-06 05:45:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:44,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:44,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:44,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:45:44,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 2027 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:45:44,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:44,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:45:44,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:45,064 INFO L130 PetriNetUnfolder]: 742/1349 cut-off events. [2022-12-06 05:45:45,064 INFO L131 PetriNetUnfolder]: For 17202/17202 co-relation queries the response was YES. [2022-12-06 05:45:45,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9359 conditions, 1349 events. 742/1349 cut-off events. For 17202/17202 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7412 event pairs, 368 based on Foata normal form. 4/1345 useless extension candidates. Maximal degree in co-relation 8751. Up to 1322 conditions per place. [2022-12-06 05:45:45,072 INFO L137 encePairwiseOnDemand]: 41/47 looper letters, 126 selfloop transitions, 8 changer transitions 1/135 dead transitions. [2022-12-06 05:45:45,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 2361 flow [2022-12-06 05:45:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:45:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:45:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 05:45:45,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36879432624113473 [2022-12-06 05:45:45,074 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 2027 flow. Second operand 3 states and 52 transitions. [2022-12-06 05:45:45,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 2361 flow [2022-12-06 05:45:45,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 2220 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:45,102 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1921 flow [2022-12-06 05:45:45,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1921, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 05:45:45,103 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 05:45:45,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:45,104 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1921 flow [2022-12-06 05:45:45,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:45,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:45,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1921 flow [2022-12-06 05:45:45,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1921 flow [2022-12-06 05:45:45,142 INFO L130 PetriNetUnfolder]: 132/452 cut-off events. [2022-12-06 05:45:45,142 INFO L131 PetriNetUnfolder]: For 4715/4765 co-relation queries the response was YES. [2022-12-06 05:45:45,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 452 events. 132/452 cut-off events. For 4715/4765 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3184 event pairs, 30 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 2558. Up to 136 conditions per place. [2022-12-06 05:45:45,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1921 flow [2022-12-06 05:45:45,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 05:45:45,147 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:45,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 05:45:45,147 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 1921 flow [2022-12-06 05:45:45,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:45:45,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:45,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:45,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:45:45,147 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1995524838, now seen corresponding path program 1 times [2022-12-06 05:45:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:45,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613545123] [2022-12-06 05:45:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:45,218 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 05:45:45,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:45,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613545123] [2022-12-06 05:45:45,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613545123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:45,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:45,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687829718] [2022-12-06 05:45:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:45,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:45,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 05:45:45,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 1921 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:45,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:45,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 05:45:45,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:45,497 INFO L130 PetriNetUnfolder]: 720/1323 cut-off events. [2022-12-06 05:45:45,498 INFO L131 PetriNetUnfolder]: For 15842/15842 co-relation queries the response was YES. [2022-12-06 05:45:45,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8790 conditions, 1323 events. 720/1323 cut-off events. For 15842/15842 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7302 event pairs, 357 based on Foata normal form. 20/1333 useless extension candidates. Maximal degree in co-relation 8093. Up to 1273 conditions per place. [2022-12-06 05:45:45,507 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 112 selfloop transitions, 20 changer transitions 8/140 dead transitions. [2022-12-06 05:45:45,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 140 transitions, 2249 flow [2022-12-06 05:45:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 05:45:45,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3423913043478261 [2022-12-06 05:45:45,508 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 1921 flow. Second operand 4 states and 63 transitions. [2022-12-06 05:45:45,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 140 transitions, 2249 flow [2022-12-06 05:45:45,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 140 transitions, 2213 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:45,537 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1949 flow [2022-12-06 05:45:45,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1949, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 05:45:45,537 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 05:45:45,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:45,538 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1949 flow [2022-12-06 05:45:45,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:45,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:45,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1949 flow [2022-12-06 05:45:45,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1949 flow [2022-12-06 05:45:45,577 INFO L130 PetriNetUnfolder]: 129/440 cut-off events. [2022-12-06 05:45:45,577 INFO L131 PetriNetUnfolder]: For 4265/4309 co-relation queries the response was YES. [2022-12-06 05:45:45,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 440 events. 129/440 cut-off events. For 4265/4309 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3033 event pairs, 28 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 2522. Up to 131 conditions per place. [2022-12-06 05:45:45,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1949 flow [2022-12-06 05:45:45,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 05:45:45,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:45,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:45,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:46,108 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:46,263 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:46,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 726 [2022-12-06 05:45:46,264 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 132 transitions, 1975 flow [2022-12-06 05:45:46,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:46,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:46,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:46,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:45:46,264 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1487787042, now seen corresponding path program 2 times [2022-12-06 05:45:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:46,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397892700] [2022-12-06 05:45:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:46,318 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 05:45:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:46,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397892700] [2022-12-06 05:45:46,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397892700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:46,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:46,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002449721] [2022-12-06 05:45:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:46,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:46,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:46,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:46,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:45:46,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 132 transitions, 1975 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:46,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:46,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:45:46,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:46,624 INFO L130 PetriNetUnfolder]: 718/1313 cut-off events. [2022-12-06 05:45:46,625 INFO L131 PetriNetUnfolder]: For 14620/14620 co-relation queries the response was YES. [2022-12-06 05:45:46,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8893 conditions, 1313 events. 718/1313 cut-off events. For 14620/14620 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7195 event pairs, 363 based on Foata normal form. 4/1307 useless extension candidates. Maximal degree in co-relation 8199. Up to 1281 conditions per place. [2022-12-06 05:45:46,632 INFO L137 encePairwiseOnDemand]: 33/50 looper letters, 114 selfloop transitions, 23 changer transitions 0/137 dead transitions. [2022-12-06 05:45:46,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 2306 flow [2022-12-06 05:45:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 05:45:46,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:45:46,633 INFO L175 Difference]: Start difference. First operand has 109 places, 132 transitions, 1975 flow. Second operand 4 states and 60 transitions. [2022-12-06 05:45:46,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 2306 flow [2022-12-06 05:45:46,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 2265 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 05:45:46,662 INFO L231 Difference]: Finished difference. Result has 112 places, 133 transitions, 2006 flow [2022-12-06 05:45:46,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2006, PETRI_PLACES=112, PETRI_TRANSITIONS=133} [2022-12-06 05:45:46,662 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-06 05:45:46,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:46,662 INFO L89 Accepts]: Start accepts. Operand has 112 places, 133 transitions, 2006 flow [2022-12-06 05:45:46,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:46,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:46,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 133 transitions, 2006 flow [2022-12-06 05:45:46,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 133 transitions, 2006 flow [2022-12-06 05:45:46,702 INFO L130 PetriNetUnfolder]: 132/451 cut-off events. [2022-12-06 05:45:46,702 INFO L131 PetriNetUnfolder]: For 4537/4592 co-relation queries the response was YES. [2022-12-06 05:45:46,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 451 events. 132/451 cut-off events. For 4537/4592 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3138 event pairs, 29 based on Foata normal form. 4/424 useless extension candidates. Maximal degree in co-relation 2622. Up to 135 conditions per place. [2022-12-06 05:45:46,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 133 transitions, 2006 flow [2022-12-06 05:45:46,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-06 05:45:46,707 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:46,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 05:45:46,707 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 133 transitions, 2006 flow [2022-12-06 05:45:46,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:46,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:46,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:46,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:45:46,708 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash 507632386, now seen corresponding path program 1 times [2022-12-06 05:45:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:46,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669915059] [2022-12-06 05:45:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:46,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:46,783 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 05:45:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:46,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669915059] [2022-12-06 05:45:46,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669915059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:46,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7107310] [2022-12-06 05:45:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:46,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:45:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:46,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:45:46,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:46,901 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 05:45:46,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:46,941 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 05:45:46,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7107310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:46,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:46,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:45:46,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759418385] [2022-12-06 05:45:46,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:46,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:45:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:45:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:45:46,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:45:46,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 133 transitions, 2006 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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 05:45:46,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:46,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:45:46,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:48,003 INFO L130 PetriNetUnfolder]: 755/1399 cut-off events. [2022-12-06 05:45:48,004 INFO L131 PetriNetUnfolder]: For 16300/16300 co-relation queries the response was YES. [2022-12-06 05:45:48,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9517 conditions, 1399 events. 755/1399 cut-off events. For 16300/16300 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7865 event pairs, 340 based on Foata normal form. 32/1413 useless extension candidates. Maximal degree in co-relation 8822. Up to 1225 conditions per place. [2022-12-06 05:45:48,010 INFO L137 encePairwiseOnDemand]: 34/50 looper letters, 139 selfloop transitions, 30 changer transitions 6/175 dead transitions. [2022-12-06 05:45:48,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 175 transitions, 2764 flow [2022-12-06 05:45:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:45:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:45:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 05:45:48,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26857142857142857 [2022-12-06 05:45:48,023 INFO L175 Difference]: Start difference. First operand has 112 places, 133 transitions, 2006 flow. Second operand 7 states and 94 transitions. [2022-12-06 05:45:48,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 175 transitions, 2764 flow [2022-12-06 05:45:48,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 175 transitions, 2717 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:48,053 INFO L231 Difference]: Finished difference. Result has 120 places, 139 transitions, 2142 flow [2022-12-06 05:45:48,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2142, PETRI_PLACES=120, PETRI_TRANSITIONS=139} [2022-12-06 05:45:48,054 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 05:45:48,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:48,054 INFO L89 Accepts]: Start accepts. Operand has 120 places, 139 transitions, 2142 flow [2022-12-06 05:45:48,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:48,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:48,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 139 transitions, 2142 flow [2022-12-06 05:45:48,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 139 transitions, 2142 flow [2022-12-06 05:45:48,096 INFO L130 PetriNetUnfolder]: 139/490 cut-off events. [2022-12-06 05:45:48,097 INFO L131 PetriNetUnfolder]: For 6027/6082 co-relation queries the response was YES. [2022-12-06 05:45:48,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 490 events. 139/490 cut-off events. For 6027/6082 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3494 event pairs, 28 based on Foata normal form. 4/465 useless extension candidates. Maximal degree in co-relation 3082. Up to 139 conditions per place. [2022-12-06 05:45:48,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 139 transitions, 2142 flow [2022-12-06 05:45:48,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-06 05:45:48,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:48,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:48,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:48,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 502 [2022-12-06 05:45:48,556 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 140 transitions, 2201 flow [2022-12-06 05:45:48,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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 05:45:48,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:48,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:48,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:48,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:48,757 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -254902856, now seen corresponding path program 2 times [2022-12-06 05:45:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:48,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775284475] [2022-12-06 05:45:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:48,805 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 05:45:48,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:48,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775284475] [2022-12-06 05:45:48,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775284475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:48,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:48,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721275600] [2022-12-06 05:45:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:48,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:48,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:48,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:45:48,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 140 transitions, 2201 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:48,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:48,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:45:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:49,232 INFO L130 PetriNetUnfolder]: 763/1393 cut-off events. [2022-12-06 05:45:49,232 INFO L131 PetriNetUnfolder]: For 21030/21030 co-relation queries the response was YES. [2022-12-06 05:45:49,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10461 conditions, 1393 events. 763/1393 cut-off events. For 21030/21030 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7769 event pairs, 144 based on Foata normal form. 12/1395 useless extension candidates. Maximal degree in co-relation 9694. Up to 618 conditions per place. [2022-12-06 05:45:49,247 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 149 selfloop transitions, 36 changer transitions 2/187 dead transitions. [2022-12-06 05:45:49,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 187 transitions, 3206 flow [2022-12-06 05:45:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:45:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:45:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 05:45:49,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2923076923076923 [2022-12-06 05:45:49,248 INFO L175 Difference]: Start difference. First operand has 120 places, 140 transitions, 2201 flow. Second operand 5 states and 76 transitions. [2022-12-06 05:45:49,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 187 transitions, 3206 flow [2022-12-06 05:45:49,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 187 transitions, 3077 flow, removed 47 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:49,299 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 2394 flow [2022-12-06 05:45:49,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2394, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2022-12-06 05:45:49,300 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-06 05:45:49,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:49,300 INFO L89 Accepts]: Start accepts. Operand has 124 places, 151 transitions, 2394 flow [2022-12-06 05:45:49,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:49,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:49,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 151 transitions, 2394 flow [2022-12-06 05:45:49,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 151 transitions, 2394 flow [2022-12-06 05:45:49,380 INFO L130 PetriNetUnfolder]: 149/484 cut-off events. [2022-12-06 05:45:49,381 INFO L131 PetriNetUnfolder]: For 7486/7536 co-relation queries the response was YES. [2022-12-06 05:45:49,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 484 events. 149/484 cut-off events. For 7486/7536 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3341 event pairs, 24 based on Foata normal form. 4/461 useless extension candidates. Maximal degree in co-relation 3331. Up to 142 conditions per place. [2022-12-06 05:45:49,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 151 transitions, 2394 flow [2022-12-06 05:45:49,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-06 05:45:49,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:49,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 655 [2022-12-06 05:45:49,955 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 150 transitions, 2386 flow [2022-12-06 05:45:49,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:49,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:49,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:49,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:45:49,955 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1211623447, now seen corresponding path program 1 times [2022-12-06 05:45:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:49,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254782713] [2022-12-06 05:45:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:50,102 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 05:45:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254782713] [2022-12-06 05:45:50,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254782713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837317521] [2022-12-06 05:45:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:50,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:50,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:45:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:50,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:45:50,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:50,476 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 05:45:50,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:50,522 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 05:45:50,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837317521] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:50,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:50,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 05:45:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920308743] [2022-12-06 05:45:50,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:50,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:45:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:45:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:45:50,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:45:50,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 150 transitions, 2386 flow. Second operand has 9 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 05:45:50,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:50,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:45:50,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:51,039 INFO L130 PetriNetUnfolder]: 832/1481 cut-off events. [2022-12-06 05:45:51,039 INFO L131 PetriNetUnfolder]: For 30317/30317 co-relation queries the response was YES. [2022-12-06 05:45:51,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12374 conditions, 1481 events. 832/1481 cut-off events. For 30317/30317 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8102 event pairs, 147 based on Foata normal form. 55/1526 useless extension candidates. Maximal degree in co-relation 11567. Up to 767 conditions per place. [2022-12-06 05:45:51,049 INFO L137 encePairwiseOnDemand]: 19/52 looper letters, 137 selfloop transitions, 72 changer transitions 0/209 dead transitions. [2022-12-06 05:45:51,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 209 transitions, 3745 flow [2022-12-06 05:45:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:45:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:45:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-12-06 05:45:51,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1987179487179487 [2022-12-06 05:45:51,050 INFO L175 Difference]: Start difference. First operand has 122 places, 150 transitions, 2386 flow. Second operand 9 states and 93 transitions. [2022-12-06 05:45:51,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 209 transitions, 3745 flow [2022-12-06 05:45:51,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 209 transitions, 3661 flow, removed 42 selfloop flow, removed 0 redundant places. [2022-12-06 05:45:51,099 INFO L231 Difference]: Finished difference. Result has 135 places, 161 transitions, 2842 flow [2022-12-06 05:45:51,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2842, PETRI_PLACES=135, PETRI_TRANSITIONS=161} [2022-12-06 05:45:51,100 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 114 predicate places. [2022-12-06 05:45:51,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:51,100 INFO L89 Accepts]: Start accepts. Operand has 135 places, 161 transitions, 2842 flow [2022-12-06 05:45:51,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:51,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:51,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 161 transitions, 2842 flow [2022-12-06 05:45:51,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 161 transitions, 2842 flow [2022-12-06 05:45:51,152 INFO L130 PetriNetUnfolder]: 166/508 cut-off events. [2022-12-06 05:45:51,152 INFO L131 PetriNetUnfolder]: For 10088/10169 co-relation queries the response was YES. [2022-12-06 05:45:51,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4307 conditions, 508 events. 166/508 cut-off events. For 10088/10169 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3420 event pairs, 24 based on Foata normal form. 8/491 useless extension candidates. Maximal degree in co-relation 4023. Up to 166 conditions per place. [2022-12-06 05:45:51,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 161 transitions, 2842 flow [2022-12-06 05:45:51,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-06 05:45:51,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:51,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 560 [2022-12-06 05:45:51,660 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 161 transitions, 2928 flow [2022-12-06 05:45:51,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 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 05:45:51,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:51,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:51,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:51,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-06 05:45:51,861 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1908327070, now seen corresponding path program 2 times [2022-12-06 05:45:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:51,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30571590] [2022-12-06 05:45:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:51,951 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 05:45:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:51,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30571590] [2022-12-06 05:45:51,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30571590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:51,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:51,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453276416] [2022-12-06 05:45:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:51,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:45:51,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 161 transitions, 2928 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:51,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:51,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:45:51,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:52,366 INFO L130 PetriNetUnfolder]: 824/1487 cut-off events. [2022-12-06 05:45:52,366 INFO L131 PetriNetUnfolder]: For 34412/34412 co-relation queries the response was YES. [2022-12-06 05:45:52,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13176 conditions, 1487 events. 824/1487 cut-off events. For 34412/34412 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8193 event pairs, 330 based on Foata normal form. 24/1501 useless extension candidates. Maximal degree in co-relation 12322. Up to 1220 conditions per place. [2022-12-06 05:45:52,376 INFO L137 encePairwiseOnDemand]: 32/56 looper letters, 137 selfloop transitions, 47 changer transitions 0/184 dead transitions. [2022-12-06 05:45:52,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 184 transitions, 3542 flow [2022-12-06 05:45:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:45:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:45:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 05:45:52,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-06 05:45:52,377 INFO L175 Difference]: Start difference. First operand has 135 places, 161 transitions, 2928 flow. Second operand 5 states and 85 transitions. [2022-12-06 05:45:52,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 184 transitions, 3542 flow [2022-12-06 05:45:52,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 3327 flow, removed 101 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:52,444 INFO L231 Difference]: Finished difference. Result has 140 places, 166 transitions, 2984 flow [2022-12-06 05:45:52,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2713, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2984, PETRI_PLACES=140, PETRI_TRANSITIONS=166} [2022-12-06 05:45:52,445 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 119 predicate places. [2022-12-06 05:45:52,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:52,445 INFO L89 Accepts]: Start accepts. Operand has 140 places, 166 transitions, 2984 flow [2022-12-06 05:45:52,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:52,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:52,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 166 transitions, 2984 flow [2022-12-06 05:45:52,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 166 transitions, 2984 flow [2022-12-06 05:45:52,500 INFO L130 PetriNetUnfolder]: 166/516 cut-off events. [2022-12-06 05:45:52,500 INFO L131 PetriNetUnfolder]: For 11776/11857 co-relation queries the response was YES. [2022-12-06 05:45:52,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 516 events. 166/516 cut-off events. For 11776/11857 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3503 event pairs, 20 based on Foata normal form. 5/497 useless extension candidates. Maximal degree in co-relation 4068. Up to 164 conditions per place. [2022-12-06 05:45:52,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 166 transitions, 2984 flow [2022-12-06 05:45:52,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 05:45:52,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:52,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:52,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:45:52,623 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 3020 flow [2022-12-06 05:45:52,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:45:52,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:52,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:52,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:45:52,623 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2041371074, now seen corresponding path program 1 times [2022-12-06 05:45:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:52,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855327542] [2022-12-06 05:45:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:53,965 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 05:45:53,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:53,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855327542] [2022-12-06 05:45:53,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855327542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:53,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729020551] [2022-12-06 05:45:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:53,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:53,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:53,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:45:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:54,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 05:45:54,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:54,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:54,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:45:54,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:54,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:54,402 INFO L321 Elim1Store]: treesize reduction 16, result has 86.8 percent of original size [2022-12-06 05:45:54,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 148 [2022-12-06 05:45:54,805 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 05:45:54,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:55,036 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 05:45:55,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729020551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:55,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:55,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:45:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077889981] [2022-12-06 05:45:55,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:55,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:45:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:45:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=89, Unknown=1, NotChecked=0, Total=132 [2022-12-06 05:45:55,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:45:55,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 167 transitions, 3020 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:45:55,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:55,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:45:55,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:03,330 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:13,972 WARN L233 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 115 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:15,055 INFO L130 PetriNetUnfolder]: 934/1710 cut-off events. [2022-12-06 05:46:15,055 INFO L131 PetriNetUnfolder]: For 41992/41992 co-relation queries the response was YES. [2022-12-06 05:46:15,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15202 conditions, 1710 events. 934/1710 cut-off events. For 41992/41992 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9982 event pairs, 236 based on Foata normal form. 4/1704 useless extension candidates. Maximal degree in co-relation 14342. Up to 1398 conditions per place. [2022-12-06 05:46:15,067 INFO L137 encePairwiseOnDemand]: 19/57 looper letters, 147 selfloop transitions, 56 changer transitions 13/216 dead transitions. [2022-12-06 05:46:15,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 216 transitions, 4052 flow [2022-12-06 05:46:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:46:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:46:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 05:46:15,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2124756335282651 [2022-12-06 05:46:15,073 INFO L175 Difference]: Start difference. First operand has 141 places, 167 transitions, 3020 flow. Second operand 9 states and 109 transitions. [2022-12-06 05:46:15,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 216 transitions, 4052 flow [2022-12-06 05:46:15,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 216 transitions, 3950 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:15,148 INFO L231 Difference]: Finished difference. Result has 151 places, 175 transitions, 3312 flow [2022-12-06 05:46:15,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3312, PETRI_PLACES=151, PETRI_TRANSITIONS=175} [2022-12-06 05:46:15,149 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 130 predicate places. [2022-12-06 05:46:15,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:15,149 INFO L89 Accepts]: Start accepts. Operand has 151 places, 175 transitions, 3312 flow [2022-12-06 05:46:15,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:15,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:15,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 175 transitions, 3312 flow [2022-12-06 05:46:15,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 175 transitions, 3312 flow [2022-12-06 05:46:15,216 INFO L130 PetriNetUnfolder]: 182/595 cut-off events. [2022-12-06 05:46:15,216 INFO L131 PetriNetUnfolder]: For 16161/16268 co-relation queries the response was YES. [2022-12-06 05:46:15,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 595 events. 182/595 cut-off events. For 16161/16268 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4348 event pairs, 28 based on Foata normal form. 6/572 useless extension candidates. Maximal degree in co-relation 4890. Up to 187 conditions per place. [2022-12-06 05:46:15,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 175 transitions, 3312 flow [2022-12-06 05:46:15,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 05:46:15,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:15,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_226| v_~f~0.base_142))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_142 (* v_~x2~0_170 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_142 (* .cse1 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_142 (* 4 .cse0))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_142 (* .cse4 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_142 (* .cse2 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_152) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_152) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_132|) 4294967296) (* 2 (mod v_~n~0_151 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_152) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_170) (< v_~x2~0_170 v_~size~0_152)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_132|) (= (ite (and (< .cse3 v_~size~0_152) (<= 0 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (< .cse4 v_~size~0_152) (<= 0 .cse4)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_142 (* .cse3 4))) v_~x2~0_168)))))))) InVars {~x2~0=v_~x2~0_170, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_142, #memory_int=|v_#memory_int_226|, ~n~0=v_~n~0_151, ~f~0.offset=v_~f~0.offset_142} OutVars{~x2~0=v_~x2~0_168, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_75|, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_142, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_79|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_132|, ~f~0.offset=v_~f~0.offset_142, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|, #memory_int=|v_#memory_int_226|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_65|, ~n~0=v_~n~0_151, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_65|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [654] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~f~0.base_162))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_162 (* v_~x1~0_280 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_162 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_216| 3) (= v_~x1~0_278 (select .cse0 (+ v_~f~0.offset_162 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_216| 4294967295) 4294967296) (* (mod v_~n~0_169 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (and (< .cse2 v_~size~0_170) (<= 0 .cse2)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_170)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|) (not (= (ite (and (< v_~x1~0_280 v_~size~0_170) (<= 0 v_~x1~0_280)) 1 0) 0)))))) InVars {~size~0=v_~size~0_170, ~f~0.base=v_~f~0.base_162, #memory_int=|v_#memory_int_252|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_280, ~f~0.offset=v_~f~0.offset_162} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|, ~size~0=v_~size~0_170, ~f~0.base=v_~f~0.base_162, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_216|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|, #memory_int=|v_#memory_int_252|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_278, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_166|, ~f~0.offset=v_~f~0.offset_162} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:15,871 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:15,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 722 [2022-12-06 05:46:15,872 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 174 transitions, 3332 flow [2022-12-06 05:46:15,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:46:15,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:15,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:15,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:16,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 05:46:16,073 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1563444456, now seen corresponding path program 3 times [2022-12-06 05:46:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:16,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378894184] [2022-12-06 05:46:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:16,129 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 05:46:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378894184] [2022-12-06 05:46:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378894184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:46:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4229273] [2022-12-06 05:46:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:46:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:46:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:46:16,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:46:16,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 174 transitions, 3332 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:46:16,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:16,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:46:16,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:16,519 INFO L130 PetriNetUnfolder]: 924/1690 cut-off events. [2022-12-06 05:46:16,520 INFO L131 PetriNetUnfolder]: For 44626/44626 co-relation queries the response was YES. [2022-12-06 05:46:16,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 1690 events. 924/1690 cut-off events. For 44626/44626 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9821 event pairs, 387 based on Foata normal form. 8/1688 useless extension candidates. Maximal degree in co-relation 14527. Up to 1353 conditions per place. [2022-12-06 05:46:16,532 INFO L137 encePairwiseOnDemand]: 32/56 looper letters, 144 selfloop transitions, 51 changer transitions 0/195 dead transitions. [2022-12-06 05:46:16,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 195 transitions, 4051 flow [2022-12-06 05:46:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-06 05:46:16,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29642857142857143 [2022-12-06 05:46:16,534 INFO L175 Difference]: Start difference. First operand has 150 places, 174 transitions, 3332 flow. Second operand 5 states and 83 transitions. [2022-12-06 05:46:16,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 195 transitions, 4051 flow [2022-12-06 05:46:16,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 195 transitions, 3864 flow, removed 73 selfloop flow, removed 6 redundant places. [2022-12-06 05:46:16,606 INFO L231 Difference]: Finished difference. Result has 149 places, 175 transitions, 3333 flow [2022-12-06 05:46:16,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3333, PETRI_PLACES=149, PETRI_TRANSITIONS=175} [2022-12-06 05:46:16,607 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2022-12-06 05:46:16,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:16,607 INFO L89 Accepts]: Start accepts. Operand has 149 places, 175 transitions, 3333 flow [2022-12-06 05:46:16,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:16,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:16,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 175 transitions, 3333 flow [2022-12-06 05:46:16,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 175 transitions, 3333 flow [2022-12-06 05:46:16,671 INFO L130 PetriNetUnfolder]: 182/590 cut-off events. [2022-12-06 05:46:16,671 INFO L131 PetriNetUnfolder]: For 15565/15696 co-relation queries the response was YES. [2022-12-06 05:46:16,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5130 conditions, 590 events. 182/590 cut-off events. For 15565/15696 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4276 event pairs, 29 based on Foata normal form. 10/569 useless extension candidates. Maximal degree in co-relation 4833. Up to 174 conditions per place. [2022-12-06 05:46:16,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 175 transitions, 3333 flow [2022-12-06 05:46:16,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-06 05:46:16,678 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:16,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 05:46:16,680 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 175 transitions, 3333 flow [2022-12-06 05:46:16,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:46:16,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:16,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 05:46:16,681 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1430528684, now seen corresponding path program 1 times [2022-12-06 05:46:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370993238] [2022-12-06 05:46:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:17,071 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 05:46:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:17,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370993238] [2022-12-06 05:46:17,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370993238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:17,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:17,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712836436] [2022-12-06 05:46:17,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:17,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:46:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:46:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:46:17,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:46:17,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 175 transitions, 3333 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:46:17,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:17,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:46:17,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:17,525 INFO L130 PetriNetUnfolder]: 976/1818 cut-off events. [2022-12-06 05:46:17,525 INFO L131 PetriNetUnfolder]: For 44612/44612 co-relation queries the response was YES. [2022-12-06 05:46:17,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16222 conditions, 1818 events. 976/1818 cut-off events. For 44612/44612 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10958 event pairs, 249 based on Foata normal form. 3/1811 useless extension candidates. Maximal degree in co-relation 15349. Up to 1574 conditions per place. [2022-12-06 05:46:17,537 INFO L137 encePairwiseOnDemand]: 18/56 looper letters, 138 selfloop transitions, 63 changer transitions 11/212 dead transitions. [2022-12-06 05:46:17,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 212 transitions, 4317 flow [2022-12-06 05:46:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 05:46:17,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3107142857142857 [2022-12-06 05:46:17,538 INFO L175 Difference]: Start difference. First operand has 149 places, 175 transitions, 3333 flow. Second operand 5 states and 87 transitions. [2022-12-06 05:46:17,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 212 transitions, 4317 flow [2022-12-06 05:46:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 212 transitions, 4179 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:17,621 INFO L231 Difference]: Finished difference. Result has 153 places, 189 transitions, 3779 flow [2022-12-06 05:46:17,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3221, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3779, PETRI_PLACES=153, PETRI_TRANSITIONS=189} [2022-12-06 05:46:17,622 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2022-12-06 05:46:17,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:17,622 INFO L89 Accepts]: Start accepts. Operand has 153 places, 189 transitions, 3779 flow [2022-12-06 05:46:17,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:17,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:17,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 189 transitions, 3779 flow [2022-12-06 05:46:17,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 189 transitions, 3779 flow [2022-12-06 05:46:17,692 INFO L130 PetriNetUnfolder]: 192/642 cut-off events. [2022-12-06 05:46:17,692 INFO L131 PetriNetUnfolder]: For 17162/17303 co-relation queries the response was YES. [2022-12-06 05:46:17,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5602 conditions, 642 events. 192/642 cut-off events. For 17162/17303 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4837 event pairs, 29 based on Foata normal form. 13/625 useless extension candidates. Maximal degree in co-relation 5298. Up to 188 conditions per place. [2022-12-06 05:46:17,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 189 transitions, 3779 flow [2022-12-06 05:46:17,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-06 05:46:17,699 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:17,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 05:46:17,699 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 189 transitions, 3779 flow [2022-12-06 05:46:17,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:46:17,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:17,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:17,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 05:46:17,699 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash 489799642, now seen corresponding path program 1 times [2022-12-06 05:46:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:17,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804508309] [2022-12-06 05:46:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:17,769 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 05:46:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:17,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804508309] [2022-12-06 05:46:17,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804508309] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:17,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599302961] [2022-12-06 05:46:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:17,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:17,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:17,784 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:17,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:46:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:17,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-06 05:46:17,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:17,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:46:17,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:46:17,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:46:18,105 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 05:46:18,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 70 [2022-12-06 05:46:18,139 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 05:46:18,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:18,579 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 05:46:18,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599302961] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:18,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:18,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 05:46:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621146172] [2022-12-06 05:46:18,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:18,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:46:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:18,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:46:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=2, NotChecked=0, Total=156 [2022-12-06 05:46:18,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:46:18,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 189 transitions, 3779 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:46:18,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:18,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:46:18,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:18,713 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* c_~x1~0 4) c_~f~0.offset)) (.cse10 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (let ((.cse5 (select |c_#memory_int| c_~f~0.base))) (let ((.cse3 (select .cse5 .cse10))) (let ((.cse4 (select .cse5 (+ (* .cse3 4) c_~f~0.offset)))) (let ((.cse8 (select .cse5 .cse9)) (.cse7 (select .cse5 (+ c_~f~0.offset (* 4 .cse4))))) (let ((.cse0 (select .cse5 (+ c_~f~0.offset (* .cse7 4)))) (.cse1 (select .cse5 (+ c_~f~0.offset (* .cse8 4))))) (let ((.cse2 (select .cse5 (+ c_~f~0.offset (* .cse1 4)))) (.cse6 (select .cse5 (+ c_~f~0.offset (* 4 .cse0))))) (or (not (<= 0 .cse0)) (<= c_~size~0 .cse1) (< .cse1 0) (< .cse2 0) (not (< .cse3 c_~size~0)) (not (< .cse4 c_~size~0)) (not (< .cse0 c_~size~0)) (= (select .cse5 (+ c_~f~0.offset (* .cse2 4))) (select .cse5 (+ (* 4 .cse6) c_~f~0.offset))) (not (<= 0 .cse3)) (not (<= 0 .cse7)) (<= c_~size~0 .cse2) (<= c_~size~0 .cse6) (not (<= 0 .cse8)) (not (< .cse8 c_~size~0)) (< .cse6 0) (not (<= 0 .cse4)) (not (< .cse7 c_~size~0))))))))) (forall ((v_ArrVal_948 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) c_~f~0.base))) (let ((.cse14 (select .cse19 .cse10))) (let ((.cse13 (select .cse19 (+ c_~f~0.offset (* .cse14 4))))) (let ((.cse18 (select .cse19 (+ c_~f~0.offset (* .cse13 4)))) (.cse12 (select .cse19 .cse9))) (let ((.cse15 (select .cse19 (+ c_~f~0.offset (* 4 .cse12)))) (.cse17 (select .cse19 (+ c_~f~0.offset (* .cse18 4))))) (let ((.cse11 (select .cse19 (+ (* .cse17 4) c_~f~0.offset))) (.cse16 (select .cse19 (+ c_~f~0.offset (* .cse15 4))))) (or (<= c_~size~0 .cse11) (not (<= 0 .cse12)) (< .cse11 0) (not (< .cse13 c_~size~0)) (not (< .cse14 c_~size~0)) (<= c_~size~0 .cse15) (< .cse15 0) (< .cse16 0) (not (< .cse17 c_~size~0)) (not (<= 0 .cse14)) (not (<= 0 .cse17)) (not (<= 0 .cse18)) (<= c_~size~0 .cse16) (not (<= 0 .cse13)) (= (select .cse19 (+ (* .cse11 4) c_~f~0.offset)) (select .cse19 (+ (* .cse16 4) c_~f~0.offset))) (not (< .cse18 c_~size~0)) (not (< .cse12 c_~size~0)))))))))))) is different from false [2022-12-06 05:46:39,534 WARN L233 SmtUtils]: Spent 20.35s on a formula simplification. DAG size of input: 128 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:54,072 WARN L233 SmtUtils]: Spent 14.41s on a formula simplification. DAG size of input: 145 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:59,865 INFO L130 PetriNetUnfolder]: 1123/2089 cut-off events. [2022-12-06 05:46:59,866 INFO L131 PetriNetUnfolder]: For 60930/60930 co-relation queries the response was YES. [2022-12-06 05:46:59,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19489 conditions, 2089 events. 1123/2089 cut-off events. For 60930/60930 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13061 event pairs, 332 based on Foata normal form. 19/2098 useless extension candidates. Maximal degree in co-relation 18609. Up to 1528 conditions per place. [2022-12-06 05:46:59,881 INFO L137 encePairwiseOnDemand]: 9/56 looper letters, 154 selfloop transitions, 114 changer transitions 7/275 dead transitions. [2022-12-06 05:46:59,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 275 transitions, 5843 flow [2022-12-06 05:46:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:46:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:46:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 138 transitions. [2022-12-06 05:46:59,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15401785714285715 [2022-12-06 05:46:59,883 INFO L175 Difference]: Start difference. First operand has 153 places, 189 transitions, 3779 flow. Second operand 16 states and 138 transitions. [2022-12-06 05:46:59,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 275 transitions, 5843 flow [2022-12-06 05:46:59,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 275 transitions, 5785 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:59,989 INFO L231 Difference]: Finished difference. Result has 176 places, 225 transitions, 5132 flow [2022-12-06 05:46:59,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3722, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5132, PETRI_PLACES=176, PETRI_TRANSITIONS=225} [2022-12-06 05:46:59,989 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 155 predicate places. [2022-12-06 05:46:59,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:59,989 INFO L89 Accepts]: Start accepts. Operand has 176 places, 225 transitions, 5132 flow [2022-12-06 05:46:59,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:59,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:59,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 225 transitions, 5132 flow [2022-12-06 05:46:59,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 225 transitions, 5132 flow [2022-12-06 05:47:00,084 INFO L130 PetriNetUnfolder]: 250/802 cut-off events. [2022-12-06 05:47:00,084 INFO L131 PetriNetUnfolder]: For 24837/24966 co-relation queries the response was YES. [2022-12-06 05:47:00,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7566 conditions, 802 events. 250/802 cut-off events. For 24837/24966 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6318 event pairs, 62 based on Foata normal form. 14/774 useless extension candidates. Maximal degree in co-relation 7230. Up to 250 conditions per place. [2022-12-06 05:47:00,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 225 transitions, 5132 flow [2022-12-06 05:47:00,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 718 [2022-12-06 05:47:00,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:00,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [679] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_288| v_~f~0.base_198))) (let ((.cse0 (* 2 (mod v_~n~0_205 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_198 (* v_~x1~0_370 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_291| 1) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (= |v_thread1Thread1of1ForFork0_~i~0#1_289| (+ |v_thread1Thread1of1ForFork0_~i~0#1_291| 2)) (= v_~x1~0_368 (select .cse1 (+ v_~f~0.offset_198 (* .cse2 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_291| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|) (not (= (ite (and (<= 0 v_~x1~0_370) (< v_~x1~0_370 v_~size~0_206)) 1 0) 0))))) InVars {~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_198, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_291|, #memory_int=|v_#memory_int_288|, ~n~0=v_~n~0_205, ~x1~0=v_~x1~0_370, ~f~0.offset=v_~f~0.offset_198} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_198, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_289|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, #memory_int=|v_#memory_int_288|, ~n~0=v_~n~0_205, ~x1~0=v_~x1~0_368, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|, ~f~0.offset=v_~f~0.offset_198} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:00,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:00,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [687] L82-3-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_405 v_~size~0_220) (<= 0 v_~x1~0_405)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_232|) (= (select (select |v_#memory_int_308| v_~f~0.base_212) (+ v_~f~0.offset_212 (* v_~x1~0_405 4))) v_~x1~0_404) (= |v_ULTIMATE.start_main_#t~pre12#1_80| |v_#pthreadsForks_94|) (= (+ |v_#pthreadsForks_94| 1) |v_#pthreadsForks_93|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_324| 4294967296) (* (mod v_~n~0_219 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_232| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_323| (+ |v_thread1Thread1of1ForFork0_~i~0#1_324| 1)) (= (store |v_#memory_int_309| |v_ULTIMATE.start_main_~#t2~0#1.base_59| (store (select |v_#memory_int_309| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) |v_ULTIMATE.start_main_~#t2~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre12#1_80|)) |v_#memory_int_308|)) InVars {~size~0=v_~size~0_220, #pthreadsForks=|v_#pthreadsForks_94|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ~f~0.base=v_~f~0.base_212, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_324|, #memory_int=|v_#memory_int_309|, ~n~0=v_~n~0_219, ~x1~0=v_~x1~0_405, ~f~0.offset=v_~f~0.offset_212, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_234|, ~size~0=v_~size~0_220, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ~f~0.base=v_~f~0.base_212, ~x1~0=v_~x1~0_404, ~f~0.offset=v_~f~0.offset_212, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_80|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_61|, #pthreadsForks=|v_#pthreadsForks_93|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_323|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_79|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_232|, #memory_int=|v_#memory_int_308|, ~n~0=v_~n~0_219, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_242|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:00,841 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 05:47:01,095 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:47:01,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1106 [2022-12-06 05:47:01,095 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 224 transitions, 5183 flow [2022-12-06 05:47:01,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:47:01,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:01,096 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:01,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 05:47:01,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 05:47:01,296 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 496157650, now seen corresponding path program 1 times [2022-12-06 05:47:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:01,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832943954] [2022-12-06 05:47:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:47:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:01,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832943954] [2022-12-06 05:47:01,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832943954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:01,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523611763] [2022-12-06 05:47:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:01,391 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:01,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:47:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:47:01,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:47:01,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:47:01,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523611763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:01,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:01,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 05:47:01,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838491024] [2022-12-06 05:47:01,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:01,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:47:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:01,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:47:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:47:01,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:47:01,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 224 transitions, 5183 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 05:47:01,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:01,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:47:01,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:02,178 INFO L130 PetriNetUnfolder]: 1209/2226 cut-off events. [2022-12-06 05:47:02,178 INFO L131 PetriNetUnfolder]: For 72653/72653 co-relation queries the response was YES. [2022-12-06 05:47:02,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22346 conditions, 2226 events. 1209/2226 cut-off events. For 72653/72653 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13901 event pairs, 329 based on Foata normal form. 26/2242 useless extension candidates. Maximal degree in co-relation 21025. Up to 1554 conditions per place. [2022-12-06 05:47:02,196 INFO L137 encePairwiseOnDemand]: 25/61 looper letters, 203 selfloop transitions, 69 changer transitions 0/272 dead transitions. [2022-12-06 05:47:02,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 272 transitions, 6480 flow [2022-12-06 05:47:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:47:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:47:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-06 05:47:02,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.273224043715847 [2022-12-06 05:47:02,197 INFO L175 Difference]: Start difference. First operand has 175 places, 224 transitions, 5183 flow. Second operand 6 states and 100 transitions. [2022-12-06 05:47:02,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 272 transitions, 6480 flow [2022-12-06 05:47:02,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 272 transitions, 5787 flow, removed 331 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:02,407 INFO L231 Difference]: Finished difference. Result has 179 places, 228 transitions, 4760 flow [2022-12-06 05:47:02,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=4534, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4760, PETRI_PLACES=179, PETRI_TRANSITIONS=228} [2022-12-06 05:47:02,407 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 158 predicate places. [2022-12-06 05:47:02,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:02,407 INFO L89 Accepts]: Start accepts. Operand has 179 places, 228 transitions, 4760 flow [2022-12-06 05:47:02,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:02,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:02,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions, 4760 flow [2022-12-06 05:47:02,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions, 4760 flow [2022-12-06 05:47:02,502 INFO L130 PetriNetUnfolder]: 262/844 cut-off events. [2022-12-06 05:47:02,502 INFO L131 PetriNetUnfolder]: For 24077/24246 co-relation queries the response was YES. [2022-12-06 05:47:02,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7541 conditions, 844 events. 262/844 cut-off events. For 24077/24246 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6735 event pairs, 64 based on Foata normal form. 10/806 useless extension candidates. Maximal degree in co-relation 7081. Up to 255 conditions per place. [2022-12-06 05:47:02,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 228 transitions, 4760 flow [2022-12-06 05:47:02,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 734 [2022-12-06 05:47:03,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:03,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 796 [2022-12-06 05:47:03,203 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 228 transitions, 4779 flow [2022-12-06 05:47:03,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 05:47:03,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:03,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:03,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 05:47:03,404 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash -839123563, now seen corresponding path program 1 times [2022-12-06 05:47:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315540977] [2022-12-06 05:47:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:04,833 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 05:47:04,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315540977] [2022-12-06 05:47:04,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315540977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:04,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:04,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303801922] [2022-12-06 05:47:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:04,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:47:04,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 228 transitions, 4779 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:47:04,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:04,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:47:04,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:05,470 INFO L130 PetriNetUnfolder]: 1241/2284 cut-off events. [2022-12-06 05:47:05,470 INFO L131 PetriNetUnfolder]: For 69022/69022 co-relation queries the response was YES. [2022-12-06 05:47:05,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22039 conditions, 2284 events. 1241/2284 cut-off events. For 69022/69022 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14416 event pairs, 436 based on Foata normal form. 1/2275 useless extension candidates. Maximal degree in co-relation 20748. Up to 2165 conditions per place. [2022-12-06 05:47:05,488 INFO L137 encePairwiseOnDemand]: 21/61 looper letters, 185 selfloop transitions, 57 changer transitions 3/245 dead transitions. [2022-12-06 05:47:05,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 245 transitions, 5541 flow [2022-12-06 05:47:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-06 05:47:05,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.319672131147541 [2022-12-06 05:47:05,489 INFO L175 Difference]: Start difference. First operand has 179 places, 228 transitions, 4779 flow. Second operand 4 states and 78 transitions. [2022-12-06 05:47:05,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 245 transitions, 5541 flow [2022-12-06 05:47:05,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 245 transitions, 5367 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-06 05:47:05,623 INFO L231 Difference]: Finished difference. Result has 179 places, 232 transitions, 4920 flow [2022-12-06 05:47:05,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=4605, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4920, PETRI_PLACES=179, PETRI_TRANSITIONS=232} [2022-12-06 05:47:05,624 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 158 predicate places. [2022-12-06 05:47:05,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:05,624 INFO L89 Accepts]: Start accepts. Operand has 179 places, 232 transitions, 4920 flow [2022-12-06 05:47:05,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:05,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:05,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 232 transitions, 4920 flow [2022-12-06 05:47:05,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 232 transitions, 4920 flow [2022-12-06 05:47:05,740 INFO L130 PetriNetUnfolder]: 269/860 cut-off events. [2022-12-06 05:47:05,740 INFO L131 PetriNetUnfolder]: For 25090/25280 co-relation queries the response was YES. [2022-12-06 05:47:05,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 860 events. 269/860 cut-off events. For 25090/25280 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6881 event pairs, 65 based on Foata normal form. 10/820 useless extension candidates. Maximal degree in co-relation 7351. Up to 259 conditions per place. [2022-12-06 05:47:05,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 232 transitions, 4920 flow [2022-12-06 05:47:05,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-06 05:47:05,749 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:05,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 05:47:05,750 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 232 transitions, 4920 flow [2022-12-06 05:47:05,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:47:05,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:05,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:05,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 05:47:05,750 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1274114946, now seen corresponding path program 1 times [2022-12-06 05:47:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:05,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359385245] [2022-12-06 05:47:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:05,812 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 05:47:05,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:05,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359385245] [2022-12-06 05:47:05,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359385245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:05,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:05,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588109292] [2022-12-06 05:47:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:05,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:05,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:05,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:05,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:47:05,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 232 transitions, 4920 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:05,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:05,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:47:05,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:06,392 INFO L130 PetriNetUnfolder]: 1310/2503 cut-off events. [2022-12-06 05:47:06,392 INFO L131 PetriNetUnfolder]: For 77853/77853 co-relation queries the response was YES. [2022-12-06 05:47:06,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24059 conditions, 2503 events. 1310/2503 cut-off events. For 77853/77853 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 16759 event pairs, 507 based on Foata normal form. 24/2517 useless extension candidates. Maximal degree in co-relation 22682. Up to 1955 conditions per place. [2022-12-06 05:47:06,408 INFO L137 encePairwiseOnDemand]: 37/61 looper letters, 239 selfloop transitions, 50 changer transitions 3/292 dead transitions. [2022-12-06 05:47:06,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 292 transitions, 6703 flow [2022-12-06 05:47:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 05:47:06,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3319672131147541 [2022-12-06 05:47:06,409 INFO L175 Difference]: Start difference. First operand has 179 places, 232 transitions, 4920 flow. Second operand 4 states and 81 transitions. [2022-12-06 05:47:06,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 292 transitions, 6703 flow [2022-12-06 05:47:06,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 292 transitions, 6619 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:06,562 INFO L231 Difference]: Finished difference. Result has 182 places, 261 transitions, 5636 flow [2022-12-06 05:47:06,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=4815, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5636, PETRI_PLACES=182, PETRI_TRANSITIONS=261} [2022-12-06 05:47:06,563 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 161 predicate places. [2022-12-06 05:47:06,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:06,563 INFO L89 Accepts]: Start accepts. Operand has 182 places, 261 transitions, 5636 flow [2022-12-06 05:47:06,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:06,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:06,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 261 transitions, 5636 flow [2022-12-06 05:47:06,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 261 transitions, 5636 flow [2022-12-06 05:47:06,687 INFO L130 PetriNetUnfolder]: 321/1038 cut-off events. [2022-12-06 05:47:06,687 INFO L131 PetriNetUnfolder]: For 32657/32825 co-relation queries the response was YES. [2022-12-06 05:47:06,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9879 conditions, 1038 events. 321/1038 cut-off events. For 32657/32825 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8714 event pairs, 63 based on Foata normal form. 5/997 useless extension candidates. Maximal degree in co-relation 9343. Up to 338 conditions per place. [2022-12-06 05:47:06,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 261 transitions, 5636 flow [2022-12-06 05:47:06,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 746 [2022-12-06 05:47:06,701 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:06,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 05:47:06,703 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 261 transitions, 5636 flow [2022-12-06 05:47:06,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:06,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:06,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:06,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 05:47:06,703 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1015405628, now seen corresponding path program 2 times [2022-12-06 05:47:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:06,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688304014] [2022-12-06 05:47:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:06,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:06,797 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 05:47:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688304014] [2022-12-06 05:47:06,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688304014] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:06,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595657612] [2022-12-06 05:47:06,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:47:06,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:06,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:06,799 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:06,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 05:47:06,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:47:06,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:47:06,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 05:47:06,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:06,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:06,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:47:06,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:06,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:07,250 INFO L321 Elim1Store]: treesize reduction 212, result has 11.3 percent of original size [2022-12-06 05:47:07,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 148 treesize of output 84 [2022-12-06 05:47:07,278 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 05:47:07,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:07,736 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (v_~x2~0_304 Int)) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) c_~f~0.base))) (let ((.cse0 (select .cse10 (+ (* c_~x2~0 4) c_~f~0.offset)))) (let ((.cse3 (select .cse10 (+ c_~f~0.offset (* .cse0 4)))) (.cse7 (select .cse10 (+ (* c_~x1~0 4) c_~f~0.offset)))) (let ((.cse5 (select .cse10 (+ (* .cse7 4) c_~f~0.offset))) (.cse8 (select .cse10 (+ (* .cse3 4) c_~f~0.offset)))) (let ((.cse1 (select .cse10 (+ (* .cse8 4) c_~f~0.offset))) (.cse6 (select .cse10 (+ c_~f~0.offset (* 4 (select .cse10 (+ c_~f~0.offset (* .cse5 4)))))))) (let ((.cse4 (select .cse10 (+ c_~f~0.offset (* v_~x2~0_304 4)))) (.cse9 (select .cse10 (+ (* 4 .cse6) c_~f~0.offset))) (.cse2 (select .cse10 (+ c_~f~0.offset (* .cse1 4))))) (or (not (<= 0 .cse0)) (not (<= 0 .cse1)) (<= c_~size~0 .cse2) (not (<= 0 .cse3)) (not (< .cse1 c_~size~0)) (< .cse4 0) (not (<= 0 .cse5)) (not (< v_~x2~0_304 c_~size~0)) (not (< .cse6 c_~size~0)) (not (<= 0 .cse7)) (<= c_~size~0 .cse4) (not (< .cse3 c_~size~0)) (not (<= 0 .cse8)) (not (<= 0 .cse6)) (not (< .cse5 c_~size~0)) (not (< .cse8 c_~size~0)) (< .cse2 0) (not (< .cse7 c_~size~0)) (< .cse9 0) (<= c_~size~0 .cse9) (not (<= 0 v_~x2~0_304)) (= (select .cse10 (+ c_~f~0.offset (* 4 .cse4))) (select .cse10 (+ c_~f~0.offset (* 4 .cse9)))) (not (<= v_~x2~0_304 (select .cse10 (+ c_~f~0.offset (* .cse2 4))))) (not (< .cse0 c_~size~0)))))))))) is different from false [2022-12-06 05:47:07,849 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 05:47:07,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595657612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:07,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:07,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 05:47:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257340099] [2022-12-06 05:47:07,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:07,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:47:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:07,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:47:07,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2022-12-06 05:47:07,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:47:07,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 261 transitions, 5636 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:47:07,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:07,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:47:07,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:11,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:14,576 INFO L130 PetriNetUnfolder]: 1394/2640 cut-off events. [2022-12-06 05:47:14,576 INFO L131 PetriNetUnfolder]: For 87955/87955 co-relation queries the response was YES. [2022-12-06 05:47:14,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26562 conditions, 2640 events. 1394/2640 cut-off events. For 87955/87955 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 17774 event pairs, 414 based on Foata normal form. 26/2652 useless extension candidates. Maximal degree in co-relation 25168. Up to 1838 conditions per place. [2022-12-06 05:47:14,595 INFO L137 encePairwiseOnDemand]: 12/61 looper letters, 187 selfloop transitions, 150 changer transitions 24/361 dead transitions. [2022-12-06 05:47:14,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 361 transitions, 8065 flow [2022-12-06 05:47:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:47:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:47:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 158 transitions. [2022-12-06 05:47:14,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1523625843780135 [2022-12-06 05:47:14,596 INFO L175 Difference]: Start difference. First operand has 182 places, 261 transitions, 5636 flow. Second operand 17 states and 158 transitions. [2022-12-06 05:47:14,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 361 transitions, 8065 flow [2022-12-06 05:47:14,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 361 transitions, 7858 flow, removed 77 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:14,763 INFO L231 Difference]: Finished difference. Result has 204 places, 283 transitions, 6414 flow [2022-12-06 05:47:14,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=5464, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6414, PETRI_PLACES=204, PETRI_TRANSITIONS=283} [2022-12-06 05:47:14,764 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 183 predicate places. [2022-12-06 05:47:14,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:14,764 INFO L89 Accepts]: Start accepts. Operand has 204 places, 283 transitions, 6414 flow [2022-12-06 05:47:14,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:14,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:14,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 283 transitions, 6414 flow [2022-12-06 05:47:14,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 283 transitions, 6414 flow [2022-12-06 05:47:14,894 INFO L130 PetriNetUnfolder]: 341/1082 cut-off events. [2022-12-06 05:47:14,894 INFO L131 PetriNetUnfolder]: For 37491/37665 co-relation queries the response was YES. [2022-12-06 05:47:14,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10826 conditions, 1082 events. 341/1082 cut-off events. For 37491/37665 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9042 event pairs, 69 based on Foata normal form. 12/1047 useless extension candidates. Maximal degree in co-relation 10256. Up to 361 conditions per place. [2022-12-06 05:47:14,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 283 transitions, 6414 flow [2022-12-06 05:47:14,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 812 [2022-12-06 05:47:14,908 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:14,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 05:47:14,908 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 283 transitions, 6414 flow [2022-12-06 05:47:14,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:47:14,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:14,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:14,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 05:47:15,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:15,113 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:15,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 160914370, now seen corresponding path program 1 times [2022-12-06 05:47:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:15,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621882] [2022-12-06 05:47:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:15,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:15,179 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 05:47:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621882] [2022-12-06 05:47:15,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:15,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:15,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:47:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134074146] [2022-12-06 05:47:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:15,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:15,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:15,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:15,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:47:15,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 283 transitions, 6414 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:47:15,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:15,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:47:15,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:15,798 INFO L130 PetriNetUnfolder]: 1465/2786 cut-off events. [2022-12-06 05:47:15,798 INFO L131 PetriNetUnfolder]: For 98906/98906 co-relation queries the response was YES. [2022-12-06 05:47:15,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28843 conditions, 2786 events. 1465/2786 cut-off events. For 98906/98906 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 18832 event pairs, 556 based on Foata normal form. 4/2784 useless extension candidates. Maximal degree in co-relation 27405. Up to 2301 conditions per place. [2022-12-06 05:47:15,824 INFO L137 encePairwiseOnDemand]: 39/61 looper letters, 266 selfloop transitions, 65 changer transitions 3/334 dead transitions. [2022-12-06 05:47:15,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 334 transitions, 8010 flow [2022-12-06 05:47:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:47:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:47:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-06 05:47:15,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25136612021857924 [2022-12-06 05:47:15,825 INFO L175 Difference]: Start difference. First operand has 204 places, 283 transitions, 6414 flow. Second operand 6 states and 92 transitions. [2022-12-06 05:47:15,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 334 transitions, 8010 flow [2022-12-06 05:47:16,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 334 transitions, 7551 flow, removed 149 selfloop flow, removed 8 redundant places. [2022-12-06 05:47:16,079 INFO L231 Difference]: Finished difference. Result has 203 places, 293 transitions, 6390 flow [2022-12-06 05:47:16,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=5975, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6390, PETRI_PLACES=203, PETRI_TRANSITIONS=293} [2022-12-06 05:47:16,079 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 182 predicate places. [2022-12-06 05:47:16,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:16,079 INFO L89 Accepts]: Start accepts. Operand has 203 places, 293 transitions, 6390 flow [2022-12-06 05:47:16,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:16,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:16,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 293 transitions, 6390 flow [2022-12-06 05:47:16,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 293 transitions, 6390 flow [2022-12-06 05:47:16,221 INFO L130 PetriNetUnfolder]: 357/1146 cut-off events. [2022-12-06 05:47:16,221 INFO L131 PetriNetUnfolder]: For 41056/41275 co-relation queries the response was YES. [2022-12-06 05:47:16,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11579 conditions, 1146 events. 357/1146 cut-off events. For 41056/41275 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9696 event pairs, 70 based on Foata normal form. 12/1106 useless extension candidates. Maximal degree in co-relation 10909. Up to 389 conditions per place. [2022-12-06 05:47:16,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 293 transitions, 6390 flow [2022-12-06 05:47:16,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 856 [2022-12-06 05:47:16,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:16,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:16,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:16,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-06 05:47:16,406 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 294 transitions, 6442 flow [2022-12-06 05:47:16,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:47:16,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:16,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:16,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 05:47:16,406 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:16,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1998584856, now seen corresponding path program 2 times [2022-12-06 05:47:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:16,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585145056] [2022-12-06 05:47:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:16,462 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 05:47:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:16,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585145056] [2022-12-06 05:47:16,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585145056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:16,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:16,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:47:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475332793] [2022-12-06 05:47:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:16,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:16,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:16,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:16,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:47:16,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 294 transitions, 6442 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:47:16,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:16,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:47:16,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:17,147 INFO L130 PetriNetUnfolder]: 1456/2767 cut-off events. [2022-12-06 05:47:17,147 INFO L131 PetriNetUnfolder]: For 96482/96482 co-relation queries the response was YES. [2022-12-06 05:47:17,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29114 conditions, 2767 events. 1456/2767 cut-off events. For 96482/96482 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 18627 event pairs, 529 based on Foata normal form. 8/2769 useless extension candidates. Maximal degree in co-relation 27596. Up to 2035 conditions per place. [2022-12-06 05:47:17,171 INFO L137 encePairwiseOnDemand]: 21/63 looper letters, 194 selfloop transitions, 136 changer transitions 4/334 dead transitions. [2022-12-06 05:47:17,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 334 transitions, 7752 flow [2022-12-06 05:47:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:47:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:47:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 05:47:17,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21541950113378686 [2022-12-06 05:47:17,172 INFO L175 Difference]: Start difference. First operand has 203 places, 294 transitions, 6442 flow. Second operand 7 states and 95 transitions. [2022-12-06 05:47:17,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 334 transitions, 7752 flow [2022-12-06 05:47:17,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 334 transitions, 7676 flow, removed 38 selfloop flow, removed 0 redundant places. [2022-12-06 05:47:17,475 INFO L231 Difference]: Finished difference. Result has 211 places, 301 transitions, 6885 flow [2022-12-06 05:47:17,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6345, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6885, PETRI_PLACES=211, PETRI_TRANSITIONS=301} [2022-12-06 05:47:17,475 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-06 05:47:17,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:17,476 INFO L89 Accepts]: Start accepts. Operand has 211 places, 301 transitions, 6885 flow [2022-12-06 05:47:17,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:17,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:17,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 301 transitions, 6885 flow [2022-12-06 05:47:17,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 301 transitions, 6885 flow [2022-12-06 05:47:17,626 INFO L130 PetriNetUnfolder]: 354/1139 cut-off events. [2022-12-06 05:47:17,627 INFO L131 PetriNetUnfolder]: For 41134/41310 co-relation queries the response was YES. [2022-12-06 05:47:17,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11769 conditions, 1139 events. 354/1139 cut-off events. For 41134/41310 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9621 event pairs, 64 based on Foata normal form. 12/1108 useless extension candidates. Maximal degree in co-relation 11083. Up to 389 conditions per place. [2022-12-06 05:47:17,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 301 transitions, 6885 flow [2022-12-06 05:47:17,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 868 [2022-12-06 05:47:17,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:17,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:17,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-06 05:47:17,742 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 300 transitions, 6883 flow [2022-12-06 05:47:17,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:47:17,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:17,742 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:17,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 05:47:17,742 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash -288095408, now seen corresponding path program 2 times [2022-12-06 05:47:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:17,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053713712] [2022-12-06 05:47:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:47:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:17,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053713712] [2022-12-06 05:47:17,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053713712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:17,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:17,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:47:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727762883] [2022-12-06 05:47:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:17,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:17,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:17,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:17,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:47:17,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 300 transitions, 6883 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:47:17,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:17,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:47:17,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:18,664 INFO L130 PetriNetUnfolder]: 1455/2762 cut-off events. [2022-12-06 05:47:18,665 INFO L131 PetriNetUnfolder]: For 103028/103028 co-relation queries the response was YES. [2022-12-06 05:47:18,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29635 conditions, 2762 events. 1455/2762 cut-off events. For 103028/103028 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 18525 event pairs, 592 based on Foata normal form. 16/2772 useless extension candidates. Maximal degree in co-relation 28294. Up to 2296 conditions per place. [2022-12-06 05:47:18,690 INFO L137 encePairwiseOnDemand]: 38/63 looper letters, 246 selfloop transitions, 81 changer transitions 0/327 dead transitions. [2022-12-06 05:47:18,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 327 transitions, 7987 flow [2022-12-06 05:47:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:47:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:47:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-06 05:47:18,692 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2920634920634921 [2022-12-06 05:47:18,692 INFO L175 Difference]: Start difference. First operand has 210 places, 300 transitions, 6883 flow. Second operand 5 states and 92 transitions. [2022-12-06 05:47:18,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 327 transitions, 7987 flow [2022-12-06 05:47:19,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 327 transitions, 7874 flow, removed 33 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:19,054 INFO L231 Difference]: Finished difference. Result has 213 places, 301 transitions, 6996 flow [2022-12-06 05:47:19,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6770, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6996, PETRI_PLACES=213, PETRI_TRANSITIONS=301} [2022-12-06 05:47:19,054 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 192 predicate places. [2022-12-06 05:47:19,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:19,054 INFO L89 Accepts]: Start accepts. Operand has 213 places, 301 transitions, 6996 flow [2022-12-06 05:47:19,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:19,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:19,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 301 transitions, 6996 flow [2022-12-06 05:47:19,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 301 transitions, 6996 flow [2022-12-06 05:47:19,205 INFO L130 PetriNetUnfolder]: 356/1142 cut-off events. [2022-12-06 05:47:19,205 INFO L131 PetriNetUnfolder]: For 43243/43426 co-relation queries the response was YES. [2022-12-06 05:47:19,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11870 conditions, 1142 events. 356/1142 cut-off events. For 43243/43426 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9649 event pairs, 62 based on Foata normal form. 12/1111 useless extension candidates. Maximal degree in co-relation 11130. Up to 386 conditions per place. [2022-12-06 05:47:19,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 301 transitions, 6996 flow [2022-12-06 05:47:19,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 868 [2022-12-06 05:47:19,237 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:19,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:47:19,238 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 301 transitions, 6996 flow [2022-12-06 05:47:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 05:47:19,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:19,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:19,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 05:47:19,238 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash -35811453, now seen corresponding path program 1 times [2022-12-06 05:47:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:19,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488255147] [2022-12-06 05:47:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:19,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:19,313 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 05:47:19,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:19,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488255147] [2022-12-06 05:47:19,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488255147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:19,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:19,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:47:19,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008712019] [2022-12-06 05:47:19,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:19,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:19,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:19,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:19,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:19,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:47:19,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 301 transitions, 6996 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:19,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:19,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:47:19,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:19,998 INFO L130 PetriNetUnfolder]: 1455/2769 cut-off events. [2022-12-06 05:47:19,998 INFO L131 PetriNetUnfolder]: For 103439/103439 co-relation queries the response was YES. [2022-12-06 05:47:20,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29852 conditions, 2769 events. 1455/2769 cut-off events. For 103439/103439 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 18671 event pairs, 687 based on Foata normal form. 2/2765 useless extension candidates. Maximal degree in co-relation 28456. Up to 2747 conditions per place. [2022-12-06 05:47:20,020 INFO L137 encePairwiseOnDemand]: 58/63 looper letters, 300 selfloop transitions, 5 changer transitions 6/311 dead transitions. [2022-12-06 05:47:20,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 311 transitions, 7748 flow [2022-12-06 05:47:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:47:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:47:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 05:47:20,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24761904761904763 [2022-12-06 05:47:20,021 INFO L175 Difference]: Start difference. First operand has 213 places, 301 transitions, 6996 flow. Second operand 5 states and 78 transitions. [2022-12-06 05:47:20,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 311 transitions, 7748 flow [2022-12-06 05:47:20,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 311 transitions, 7585 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:20,256 INFO L231 Difference]: Finished difference. Result has 215 places, 300 transitions, 6818 flow [2022-12-06 05:47:20,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6833, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6818, PETRI_PLACES=215, PETRI_TRANSITIONS=300} [2022-12-06 05:47:20,257 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 194 predicate places. [2022-12-06 05:47:20,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:20,257 INFO L89 Accepts]: Start accepts. Operand has 215 places, 300 transitions, 6818 flow [2022-12-06 05:47:20,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:20,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:20,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 300 transitions, 6818 flow [2022-12-06 05:47:20,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 300 transitions, 6818 flow [2022-12-06 05:47:20,401 INFO L130 PetriNetUnfolder]: 356/1135 cut-off events. [2022-12-06 05:47:20,401 INFO L131 PetriNetUnfolder]: For 42879/43084 co-relation queries the response was YES. [2022-12-06 05:47:20,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11778 conditions, 1135 events. 356/1135 cut-off events. For 42879/43084 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9534 event pairs, 65 based on Foata normal form. 14/1105 useless extension candidates. Maximal degree in co-relation 11090. Up to 388 conditions per place. [2022-12-06 05:47:20,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 300 transitions, 6818 flow [2022-12-06 05:47:20,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 866 [2022-12-06 05:47:20,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:20,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:20,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 467 [2022-12-06 05:47:20,724 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 300 transitions, 6836 flow [2022-12-06 05:47:20,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:20,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:20,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:20,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 05:47:20,725 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash -631468990, now seen corresponding path program 3 times [2022-12-06 05:47:20,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:20,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396130774] [2022-12-06 05:47:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:20,823 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 05:47:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:20,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396130774] [2022-12-06 05:47:20,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396130774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:20,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784318285] [2022-12-06 05:47:20,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:47:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:20,840 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:20,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 05:47:21,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 05:47:21,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:47:21,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:47:21,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:21,035 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 05:47:21,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:21,057 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 05:47:21,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784318285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:21,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:21,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 05:47:21,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112893285] [2022-12-06 05:47:21,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:21,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:47:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:47:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:47:21,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:47:21,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 300 transitions, 6836 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 05:47:21,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:21,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:47:21,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:21,980 INFO L130 PetriNetUnfolder]: 1467/2782 cut-off events. [2022-12-06 05:47:21,980 INFO L131 PetriNetUnfolder]: For 100692/100692 co-relation queries the response was YES. [2022-12-06 05:47:21,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29827 conditions, 2782 events. 1467/2782 cut-off events. For 100692/100692 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 18665 event pairs, 234 based on Foata normal form. 4/2780 useless extension candidates. Maximal degree in co-relation 28466. Up to 1956 conditions per place. [2022-12-06 05:47:22,010 INFO L137 encePairwiseOnDemand]: 21/64 looper letters, 240 selfloop transitions, 118 changer transitions 2/360 dead transitions. [2022-12-06 05:47:22,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 360 transitions, 8576 flow [2022-12-06 05:47:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:47:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:47:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-12-06 05:47:22,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14973958333333334 [2022-12-06 05:47:22,011 INFO L175 Difference]: Start difference. First operand has 214 places, 300 transitions, 6836 flow. Second operand 12 states and 115 transitions. [2022-12-06 05:47:22,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 360 transitions, 8576 flow [2022-12-06 05:47:22,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 360 transitions, 8550 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:22,249 INFO L231 Difference]: Finished difference. Result has 224 places, 306 transitions, 7250 flow [2022-12-06 05:47:22,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=6814, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7250, PETRI_PLACES=224, PETRI_TRANSITIONS=306} [2022-12-06 05:47:22,250 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 203 predicate places. [2022-12-06 05:47:22,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:22,250 INFO L89 Accepts]: Start accepts. Operand has 224 places, 306 transitions, 7250 flow [2022-12-06 05:47:22,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:22,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:22,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 306 transitions, 7250 flow [2022-12-06 05:47:22,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 306 transitions, 7250 flow [2022-12-06 05:47:22,413 INFO L130 PetriNetUnfolder]: 357/1131 cut-off events. [2022-12-06 05:47:22,413 INFO L131 PetriNetUnfolder]: For 44713/44943 co-relation queries the response was YES. [2022-12-06 05:47:22,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12025 conditions, 1131 events. 357/1131 cut-off events. For 44713/44943 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9486 event pairs, 63 based on Foata normal form. 16/1102 useless extension candidates. Maximal degree in co-relation 11275. Up to 391 conditions per place. [2022-12-06 05:47:22,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 306 transitions, 7250 flow [2022-12-06 05:47:22,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-06 05:47:22,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:22,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:22,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:23,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:23,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:23,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:23,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:23,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,825 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:24,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:25,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_205| v_~f~0.base_128))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_128 (* v_~x2~0_143 4)))) (.cse1 (* 2 (mod v_~n~0_137 2147483648)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_138)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_157| 4294967296) .cse1) (= v_~x1~0_194 (select .cse2 (+ v_~f~0.offset_128 (* v_~x1~0_195 4)))) (not (= (ite (and (< v_~x2~0_143 v_~size~0_138) (<= 0 v_~x2~0_143)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_156| (+ |v_thread1Thread1of1ForFork0_~i~0#1_157| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~x1~0_195 v_~size~0_138) (<= 0 v_~x1~0_195)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_109|) |v_thread2Thread1of1ForFork1_~i~1#1_108|) (= (select .cse2 (+ v_~f~0.offset_128 (* .cse0 4))) v_~x2~0_142) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_109| 4294967296) .cse1)))) InVars {~x2~0=v_~x2~0_143, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~n~0=v_~n~0_137, ~x1~0=v_~x1~0_195, ~f~0.offset=v_~f~0.offset_128} OutVars{~x2~0=v_~x2~0_142, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_108|, ~x1~0=v_~x1~0_194, ~f~0.offset=v_~f~0.offset_128, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_205|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_137, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:25,343 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse1 (* (mod v_~n~0_139 2147483648) 2)) (.cse0 (select .cse2 (+ v_~f~0.offset_130 (* v_~x2~0_147 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_147) (< v_~x2~0_147 v_~size~0_140)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_161| 1) |v_thread1Thread1of1ForFork0_~i~0#1_160|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_113| 4294967296) .cse1) (= v_~x1~0_198 (select .cse2 (+ v_~f~0.offset_130 (* v_~x1~0_199 4)))) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_113|) |v_thread2Thread1of1ForFork1_~i~1#1_112|) (= (ite (and (< v_~x1~0_199 v_~size~0_140) (<= 0 v_~x1~0_199)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_161| 4294967296) .cse1) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_130 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0))))) InVars {~x2~0=v_~x2~0_147, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_161|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_113|, ~n~0=v_~n~0_139, ~x1~0=v_~x1~0_199, ~f~0.offset=v_~f~0.offset_130} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~x1~0=v_~x1~0_198, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_51|, ~n~0=v_~n~0_139, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:25,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_276| v_~f~0.base_186))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_186 (* v_~x1~0_335 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_186 (* v_~x2~0_258 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_186 (* .cse2 4)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_256| 4294967295) 4294967296) .cse0) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_196|) |v_thread2Thread1of1ForFork1_~i~1#1_195|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_194)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_335 v_~size~0_194) (<= 0 v_~x1~0_335)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_256| (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= v_~x1~0_334 (select .cse3 (+ v_~f~0.offset_186 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188| 0)) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_194)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_186 (* .cse1 4))) v_~x2~0_257) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_196| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, #memory_int=|v_#memory_int_276|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_196|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_335, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_257, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_190|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_126|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_195|, ~x1~0=v_~x1~0_334, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_256|, #memory_int=|v_#memory_int_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_116|, ~n~0=v_~n~0_193, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_116|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:25,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_268| v_~f~0.base_178))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_178 (* v_~x2~0_241 4)))) (.cse2 (* (mod v_~n~0_185 2147483648) 2)) (.cse3 (select .cse0 (+ v_~f~0.offset_178 (* v_~x1~0_317 4))))) (and (= (select .cse0 (+ v_~f~0.offset_178 (* .cse1 4))) v_~x2~0_240) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_186)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_239| 4294967296) .cse2) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_179| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_241) (< v_~x2~0_241 v_~size~0_186)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_238| 4294967295) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_178| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_179|)) (not (= (ite (and (< v_~x1~0_317 v_~size~0_186) (<= 0 v_~x1~0_317)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_178 (* .cse3 4))) v_~x1~0_316) (= (ite (and (< .cse3 v_~size~0_186) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162|) (= |v_thread1Thread1of1ForFork0_~i~0#1_238| (+ |v_thread1Thread1of1ForFork0_~i~0#1_239| 2))))) InVars {~x2~0=v_~x2~0_241, ~size~0=v_~size~0_186, ~f~0.base=v_~f~0.base_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_239|, #memory_int=|v_#memory_int_268|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_179|, ~n~0=v_~n~0_185, ~x1~0=v_~x1~0_317, ~f~0.offset=v_~f~0.offset_178} OutVars{~x2~0=v_~x2~0_240, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_180|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, ~size~0=v_~size~0_186, ~f~0.base=v_~f~0.base_178, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_121|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_178|, ~x1~0=v_~x1~0_316, ~f~0.offset=v_~f~0.offset_178, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_238|, #memory_int=|v_#memory_int_268|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_107|, ~n~0=v_~n~0_185, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_107|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_188|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:26,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_274| v_~f~0.base_184))) (let ((.cse0 (* 2 (mod v_~n~0_191 2147483648))) (.cse1 (select .cse2 (+ v_~f~0.offset_184 (* v_~x2~0_253 4))))) (and (= (ite (and (< v_~x1~0_329 v_~size~0_192) (<= 0 v_~x1~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_251| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_253 v_~size~0_192) (<= 0 v_~x2~0_253)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_191|) |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= |v_thread1Thread1of1ForFork0_~i~0#1_250| (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_191| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_184 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= v_~x1~0_328 (select .cse2 (+ v_~f~0.offset_184 (* v_~x1~0_329 4))))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, #memory_int=|v_#memory_int_274|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_190|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_250|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_113|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_113|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:26,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_304| v_~f~0.base_208))) (let ((.cse0 (* 2 (mod v_~n~0_215 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_208 (* v_~x1~0_396 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_313| 4294967295) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_210| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226| 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_315| 2) |v_thread1Thread1of1ForFork0_~i~0#1_313|) (not (= (ite (and (<= 0 v_~x1~0_396) (< v_~x1~0_396 v_~size~0_216)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_315| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_208 (* .cse2 4))) v_~x1~0_394) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_210| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_216)) 1 0))))) InVars {~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_215, ~x1~0=v_~x1~0_396, ~f~0.offset=v_~f~0.offset_208} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_210|, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226|, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_215, ~x1~0=v_~x1~0_394, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_236|, ~f~0.offset=v_~f~0.offset_208} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:26,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [681] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_295| v_~f~0.base_202))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_202 (* v_~x2~0_277 4)))) (.cse0 (* (mod v_~n~0_209 2147483648) 2))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_211| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| (ite (and (< .cse1 v_~size~0_210) (<= 0 .cse1)) 1 0)) (= (ite (and (< v_~x1~0_379 v_~size~0_210) (<= 0 v_~x1~0_379)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|) (= v_~x2~0_276 (select .cse2 (+ v_~f~0.offset_202 (* 4 .cse1)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217| 0)) (not (= (ite (and (<= 0 v_~x2~0_277) (< v_~x2~0_277 v_~size~0_210)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_211|) |v_thread2Thread1of1ForFork1_~i~1#1_210|) (= v_~x1~0_378 (select .cse2 (+ v_~f~0.offset_202 (* v_~x1~0_379 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_301| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_300| (+ |v_thread1Thread1of1ForFork0_~i~0#1_301| 1))))) InVars {~x2~0=v_~x2~0_277, ~size~0=v_~size~0_210, ~f~0.base=v_~f~0.base_202, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_301|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_211|, ~n~0=v_~n~0_209, ~x1~0=v_~x1~0_379, ~f~0.offset=v_~f~0.offset_202} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_219|, ~x2~0=v_~x2~0_276, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_137|, ~size~0=v_~size~0_210, ~f~0.base=v_~f~0.base_202, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_141|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_210|, ~x1~0=v_~x1~0_378, ~f~0.offset=v_~f~0.offset_202, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_300|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_127|, ~n~0=v_~n~0_209, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_227|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_127|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:26,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_221| v_~f~0.base_140))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_140 (* v_~x2~0_163 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648)))) (and (= (ite (and (< .cse0 v_~size~0_150) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= (select .cse1 (+ v_~f~0.offset_140 (* v_~x1~0_227 4))) v_~x1~0_226) (= (ite (and (<= 0 v_~x1~0_227) (< v_~x1~0_227 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_180| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_179| (+ |v_thread1Thread1of1ForFork0_~i~0#1_180| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_127|) |v_thread2Thread1of1ForFork1_~i~1#1_126|) (= (select .cse1 (+ v_~f~0.offset_140 (* .cse0 4))) v_~x2~0_162) (not (= (ite (and (< v_~x2~0_163 v_~size~0_150) (<= 0 v_~x2~0_163)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_127| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|)))) InVars {~x2~0=v_~x2~0_163, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_140, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_180|, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_127|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_227, ~f~0.offset=v_~f~0.offset_140} OutVars{~x2~0=v_~x2~0_162, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_127|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_71|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_140, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_75|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_126|, ~x1~0=v_~x1~0_226, ~f~0.offset=v_~f~0.offset_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_179|, #memory_int=|v_#memory_int_221|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_61|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:27,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:27,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:27,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [665] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_270| v_~f~0.base_180))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_180 (* v_~x1~0_321 4)))) (.cse0 (* 2 (mod v_~n~0_187 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_180 (* v_~x2~0_245 4))))) (and (not (= (ite (and (< v_~x1~0_321 v_~size~0_188) (<= 0 v_~x1~0_321)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_183|) |v_thread2Thread1of1ForFork1_~i~1#1_182|) (= |v_thread1Thread1of1ForFork0_~i~0#1_242| (+ |v_thread1Thread1of1ForFork0_~i~0#1_243| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_242| 4294967295) 4294967296) .cse0) (= v_~x2~0_244 (select .cse1 (+ v_~f~0.offset_180 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| (ite (and (< .cse3 v_~size~0_188) (<= 0 .cse3)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_243| 4294967296) .cse0) (= v_~x1~0_320 (select .cse1 (+ v_~f~0.offset_180 (* .cse3 4)))) (not (= (ite (and (< v_~x2~0_245 v_~size~0_188) (<= 0 v_~x2~0_245)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_183| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_188)) 1 0))))) InVars {~x2~0=v_~x2~0_245, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_243|, #memory_int=|v_#memory_int_270|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_183|, ~n~0=v_~n~0_187, ~x1~0=v_~x1~0_321, ~f~0.offset=v_~f~0.offset_180} OutVars{~x2~0=v_~x2~0_244, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_182|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_182|, ~x1~0=v_~x1~0_320, ~f~0.offset=v_~f~0.offset_180, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_242|, #memory_int=|v_#memory_int_270|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_109|, ~n~0=v_~n~0_187, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_190|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:27,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_272| v_~f~0.base_182))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_182 (* v_~x2~0_249 4)))) (.cse2 (* (mod v_~n~0_189 2147483648) 2))) (and (= (select .cse0 (+ v_~f~0.offset_182 (* .cse1 4))) v_~x2~0_248) (= v_~x1~0_324 (select .cse0 (+ v_~f~0.offset_182 (* v_~x1~0_325 4)))) (not (= (ite (and (< v_~x2~0_249 v_~size~0_190) (<= 0 v_~x2~0_249)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_247| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| (ite (and (< .cse1 v_~size~0_190) (<= 0 .cse1)) 1 0)) (= (ite (and (< v_~x1~0_325 v_~size~0_190) (<= 0 v_~x1~0_325)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_186|) (= |v_thread1Thread1of1ForFork0_~i~0#1_246| (+ |v_thread1Thread1of1ForFork0_~i~0#1_247| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|)))) InVars {~x2~0=v_~x2~0_249, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_182, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_247|, #memory_int=|v_#memory_int_272|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_189, ~x1~0=v_~x1~0_325, ~f~0.offset=v_~f~0.offset_182} OutVars{~x2~0=v_~x2~0_248, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_184|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_121|, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_182, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_186|, ~x1~0=v_~x1~0_324, ~f~0.offset=v_~f~0.offset_182, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_246|, #memory_int=|v_#memory_int_272|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_111|, ~n~0=v_~n~0_189, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_111|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_192|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:27,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:28,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:28,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:28,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse1 (* (mod v_~n~0_139 2147483648) 2)) (.cse0 (select .cse2 (+ v_~f~0.offset_130 (* v_~x2~0_147 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_147) (< v_~x2~0_147 v_~size~0_140)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_161| 1) |v_thread1Thread1of1ForFork0_~i~0#1_160|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_113| 4294967296) .cse1) (= v_~x1~0_198 (select .cse2 (+ v_~f~0.offset_130 (* v_~x1~0_199 4)))) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_113|) |v_thread2Thread1of1ForFork1_~i~1#1_112|) (= (ite (and (< v_~x1~0_199 v_~size~0_140) (<= 0 v_~x1~0_199)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_161| 4294967296) .cse1) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_130 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0))))) InVars {~x2~0=v_~x2~0_147, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_161|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_113|, ~n~0=v_~n~0_139, ~x1~0=v_~x1~0_199, ~f~0.offset=v_~f~0.offset_130} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~x1~0=v_~x1~0_198, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_51|, ~n~0=v_~n~0_139, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:28,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_205| v_~f~0.base_128))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_128 (* v_~x2~0_143 4)))) (.cse1 (* 2 (mod v_~n~0_137 2147483648)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_138)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_157| 4294967296) .cse1) (= v_~x1~0_194 (select .cse2 (+ v_~f~0.offset_128 (* v_~x1~0_195 4)))) (not (= (ite (and (< v_~x2~0_143 v_~size~0_138) (<= 0 v_~x2~0_143)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_156| (+ |v_thread1Thread1of1ForFork0_~i~0#1_157| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~x1~0_195 v_~size~0_138) (<= 0 v_~x1~0_195)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_109|) |v_thread2Thread1of1ForFork1_~i~1#1_108|) (= (select .cse2 (+ v_~f~0.offset_128 (* .cse0 4))) v_~x2~0_142) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_109| 4294967296) .cse1)))) InVars {~x2~0=v_~x2~0_143, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~n~0=v_~n~0_137, ~x1~0=v_~x1~0_195, ~f~0.offset=v_~f~0.offset_128} OutVars{~x2~0=v_~x2~0_142, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_108|, ~x1~0=v_~x1~0_194, ~f~0.offset=v_~f~0.offset_128, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_205|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_137, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:28,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_248| v_~f~0.base_158))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_158 (* v_~x2~0_199 4)))) (.cse1 (* (mod v_~n~0_165 2147483648) 2))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (and (< .cse0 v_~size~0_166) (<= 0 .cse0)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_199) (< v_~x2~0_199 v_~size~0_166)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_209| 4294967296) .cse1) (= v_~x2~0_198 (select .cse2 (+ v_~f~0.offset_158 (* .cse0 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_208| (+ |v_thread1Thread1of1ForFork0_~i~0#1_209| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|) (= (ite (and (<= 0 v_~x1~0_269) (< v_~x1~0_269 v_~size~0_166)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (= |v_thread2Thread1of1ForFork1_~i~1#1_152| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_153|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_153| 4294967296) .cse1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131| 0)) (= (select .cse2 (+ v_~f~0.offset_158 (* v_~x1~0_269 4))) v_~x1~0_268)))) InVars {~x2~0=v_~x2~0_199, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_158, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_209|, #memory_int=|v_#memory_int_248|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_153|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_269, ~f~0.offset=v_~f~0.offset_158} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_152|, ~x2~0=v_~x2~0_198, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_93|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_158, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_97|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_152|, ~x1~0=v_~x1~0_268, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_208|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|, #memory_int=|v_#memory_int_248|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_83|, ~n~0=v_~n~0_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_160|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_83|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:28,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:29,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:29,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:29,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:29,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:29,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:29,633 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:29,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7384 [2022-12-06 05:47:29,634 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 327 transitions, 8387 flow [2022-12-06 05:47:29,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 05:47:29,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:29,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:29,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:29,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 05:47:29,840 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1738083007, now seen corresponding path program 1 times [2022-12-06 05:47:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:29,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522773708] [2022-12-06 05:47:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:29,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:29,920 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 05:47:29,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:29,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522773708] [2022-12-06 05:47:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522773708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:29,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:29,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:47:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074279128] [2022-12-06 05:47:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:29,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:29,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 103 [2022-12-06 05:47:29,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 327 transitions, 8387 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:29,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:29,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 103 [2022-12-06 05:47:29,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:30,709 INFO L130 PetriNetUnfolder]: 1547/2974 cut-off events. [2022-12-06 05:47:30,709 INFO L131 PetriNetUnfolder]: For 117412/117412 co-relation queries the response was YES. [2022-12-06 05:47:30,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31889 conditions, 2974 events. 1547/2974 cut-off events. For 117412/117412 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 20747 event pairs, 353 based on Foata normal form. 6/2978 useless extension candidates. Maximal degree in co-relation 30558. Up to 1508 conditions per place. [2022-12-06 05:47:30,736 INFO L137 encePairwiseOnDemand]: 66/103 looper letters, 268 selfloop transitions, 69 changer transitions 13/350 dead transitions. [2022-12-06 05:47:30,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 350 transitions, 8680 flow [2022-12-06 05:47:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:47:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:47:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 05:47:30,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14401294498381878 [2022-12-06 05:47:30,737 INFO L175 Difference]: Start difference. First operand has 223 places, 327 transitions, 8387 flow. Second operand 6 states and 89 transitions. [2022-12-06 05:47:30,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 350 transitions, 8680 flow [2022-12-06 05:47:30,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 350 transitions, 8475 flow, removed 37 selfloop flow, removed 5 redundant places. [2022-12-06 05:47:30,996 INFO L231 Difference]: Finished difference. Result has 226 places, 295 transitions, 6980 flow [2022-12-06 05:47:30,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=6511, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6980, PETRI_PLACES=226, PETRI_TRANSITIONS=295} [2022-12-06 05:47:30,996 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 205 predicate places. [2022-12-06 05:47:30,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:30,996 INFO L89 Accepts]: Start accepts. Operand has 226 places, 295 transitions, 6980 flow [2022-12-06 05:47:30,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:30,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:30,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 295 transitions, 6980 flow [2022-12-06 05:47:31,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 295 transitions, 6980 flow [2022-12-06 05:47:31,155 INFO L130 PetriNetUnfolder]: 357/1185 cut-off events. [2022-12-06 05:47:31,155 INFO L131 PetriNetUnfolder]: For 51016/51191 co-relation queries the response was YES. [2022-12-06 05:47:31,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12553 conditions, 1185 events. 357/1185 cut-off events. For 51016/51191 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10284 event pairs, 64 based on Foata normal form. 10/1153 useless extension candidates. Maximal degree in co-relation 11742. Up to 416 conditions per place. [2022-12-06 05:47:31,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 295 transitions, 6980 flow [2022-12-06 05:47:31,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 852 [2022-12-06 05:47:32,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_201| v_~f~0.base_124))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_124 (* v_~x2~0_132 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_124 (* v_~x1~0_189 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= (ite (and (< .cse0 v_~size~0_134) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (not (= (ite (and (<= 0 v_~x2~0_132) (< v_~x2~0_132 v_~size~0_134)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_152| 2) (= (select .cse1 (+ v_~f~0.offset_124 (* .cse2 4))) v_~x2~0_131) (< 0 (* 2 (mod v_~n~0_133 2147483648))) (not (= (ite (and (< v_~x1~0_189 v_~size~0_134) (<= 0 v_~x1~0_189)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_134)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|) (= (select .cse1 (+ v_~f~0.offset_124 (* 4 .cse0))) v_~x1~0_188) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_101|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|)))) InVars {~x2~0=v_~x2~0_132, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, #memory_int=|v_#memory_int_201|, ~n~0=v_~n~0_133, ~x1~0=v_~x1~0_189, ~f~0.offset=v_~f~0.offset_124} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_104|, ~x2~0=v_~x2~0_131, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_52|, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_101|, ~x1~0=v_~x1~0_188, ~f~0.offset=v_~f~0.offset_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, #memory_int=|v_#memory_int_201|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_42|, ~n~0=v_~n~0_133, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:32,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:33,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:33,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:35,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_201| v_~f~0.base_124))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_124 (* v_~x2~0_132 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_124 (* v_~x1~0_189 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= (ite (and (< .cse0 v_~size~0_134) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (not (= (ite (and (<= 0 v_~x2~0_132) (< v_~x2~0_132 v_~size~0_134)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_152| 2) (= (select .cse1 (+ v_~f~0.offset_124 (* .cse2 4))) v_~x2~0_131) (< 0 (* 2 (mod v_~n~0_133 2147483648))) (not (= (ite (and (< v_~x1~0_189 v_~size~0_134) (<= 0 v_~x1~0_189)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_134)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|) (= (select .cse1 (+ v_~f~0.offset_124 (* 4 .cse0))) v_~x1~0_188) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_101|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|)))) InVars {~x2~0=v_~x2~0_132, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, #memory_int=|v_#memory_int_201|, ~n~0=v_~n~0_133, ~x1~0=v_~x1~0_189, ~f~0.offset=v_~f~0.offset_124} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_104|, ~x2~0=v_~x2~0_131, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_52|, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_101|, ~x1~0=v_~x1~0_188, ~f~0.offset=v_~f~0.offset_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, #memory_int=|v_#memory_int_201|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_42|, ~n~0=v_~n~0_133, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [540] L98-6-->L98-6: Formula: (and (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (store |v_#memory_int_71| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_71| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22|)) |v_#memory_int_70|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22|, #memory_int=|v_#memory_int_71|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_23|, #memory_int=|v_#memory_int_70|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] [2022-12-06 05:47:35,353 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:47:35,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4357 [2022-12-06 05:47:35,354 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 294 transitions, 7135 flow [2022-12-06 05:47:35,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:35,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:35,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:35,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 05:47:35,354 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -651364561, now seen corresponding path program 1 times [2022-12-06 05:47:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:35,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014565908] [2022-12-06 05:47:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:35,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:35,509 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 05:47:35,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:35,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014565908] [2022-12-06 05:47:35,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014565908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:35,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565387258] [2022-12-06 05:47:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:35,518 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:35,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 05:47:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:35,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:47:35,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:35,643 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 05:47:35,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:35,691 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 05:47:35,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565387258] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:35,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:35,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 05:47:35,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769647782] [2022-12-06 05:47:35,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:35,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:47:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:47:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:47:35,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 05:47:35,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 294 transitions, 7135 flow. Second operand has 11 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 05:47:35,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:35,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 05:47:35,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:36,856 INFO L130 PetriNetUnfolder]: 1544/2971 cut-off events. [2022-12-06 05:47:36,856 INFO L131 PetriNetUnfolder]: For 130342/130342 co-relation queries the response was YES. [2022-12-06 05:47:36,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32454 conditions, 2971 events. 1544/2971 cut-off events. For 130342/130342 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20700 event pairs, 541 based on Foata normal form. 16/2985 useless extension candidates. Maximal degree in co-relation 31304. Up to 2101 conditions per place. [2022-12-06 05:47:36,884 INFO L137 encePairwiseOnDemand]: 17/67 looper letters, 186 selfloop transitions, 165 changer transitions 16/367 dead transitions. [2022-12-06 05:47:36,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 367 transitions, 9017 flow [2022-12-06 05:47:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:47:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:47:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2022-12-06 05:47:36,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17503392130257803 [2022-12-06 05:47:36,885 INFO L175 Difference]: Start difference. First operand has 223 places, 294 transitions, 7135 flow. Second operand 11 states and 129 transitions. [2022-12-06 05:47:36,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 367 transitions, 9017 flow [2022-12-06 05:47:37,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 367 transitions, 8600 flow, removed 175 selfloop flow, removed 5 redundant places. [2022-12-06 05:47:37,208 INFO L231 Difference]: Finished difference. Result has 232 places, 308 transitions, 7438 flow [2022-12-06 05:47:37,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=6682, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7438, PETRI_PLACES=232, PETRI_TRANSITIONS=308} [2022-12-06 05:47:37,208 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 211 predicate places. [2022-12-06 05:47:37,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:37,208 INFO L89 Accepts]: Start accepts. Operand has 232 places, 308 transitions, 7438 flow [2022-12-06 05:47:37,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:37,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:37,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 308 transitions, 7438 flow [2022-12-06 05:47:37,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 308 transitions, 7438 flow [2022-12-06 05:47:37,407 INFO L130 PetriNetUnfolder]: 371/1213 cut-off events. [2022-12-06 05:47:37,407 INFO L131 PetriNetUnfolder]: For 54119/54256 co-relation queries the response was YES. [2022-12-06 05:47:37,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13162 conditions, 1213 events. 371/1213 cut-off events. For 54119/54256 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10475 event pairs, 63 based on Foata normal form. 8/1187 useless extension candidates. Maximal degree in co-relation 12251. Up to 419 conditions per place. [2022-12-06 05:47:37,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 308 transitions, 7438 flow [2022-12-06 05:47:37,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 864 [2022-12-06 05:47:37,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_264| v_~f~0.base_174))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_174 (* v_~x1~0_309 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_174 (* v_~x2~0_233 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_234| 2) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_182)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|) (not (= (ite (and (< v_~x1~0_309 v_~size~0_182) (<= 0 v_~x1~0_309)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (= v_~x1~0_308 (select .cse1 (+ v_~f~0.offset_174 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_233) (< v_~x2~0_233 v_~size~0_182)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_174|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (= v_~x2~0_232 (select .cse1 (+ v_~f~0.offset_174 (* .cse2 4)))) (< 0 (* 2 (mod v_~n~0_181 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (and (< .cse2 v_~size~0_182) (<= 0 .cse2)) 1 0))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, #memory_int=|v_#memory_int_264|, ~n~0=v_~n~0_181, ~x1~0=v_~x1~0_309, ~f~0.offset=v_~f~0.offset_174} OutVars{~x2~0=v_~x2~0_232, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_176|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_174|, ~x1~0=v_~x1~0_308, ~f~0.offset=v_~f~0.offset_174, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_234|, #memory_int=|v_#memory_int_264|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_103|, ~n~0=v_~n~0_181, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_103|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_184|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:38,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_264| v_~f~0.base_174))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_174 (* v_~x1~0_309 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_174 (* v_~x2~0_233 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_234| 2) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_182)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|) (not (= (ite (and (< v_~x1~0_309 v_~size~0_182) (<= 0 v_~x1~0_309)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (= v_~x1~0_308 (select .cse1 (+ v_~f~0.offset_174 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_233) (< v_~x2~0_233 v_~size~0_182)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_174|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (= v_~x2~0_232 (select .cse1 (+ v_~f~0.offset_174 (* .cse2 4)))) (< 0 (* 2 (mod v_~n~0_181 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (and (< .cse2 v_~size~0_182) (<= 0 .cse2)) 1 0))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, #memory_int=|v_#memory_int_264|, ~n~0=v_~n~0_181, ~x1~0=v_~x1~0_309, ~f~0.offset=v_~f~0.offset_174} OutVars{~x2~0=v_~x2~0_232, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_176|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_174|, ~x1~0=v_~x1~0_308, ~f~0.offset=v_~f~0.offset_174, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_234|, #memory_int=|v_#memory_int_264|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_103|, ~n~0=v_~n~0_181, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_103|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_184|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [665] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_270| v_~f~0.base_180))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_180 (* v_~x1~0_321 4)))) (.cse0 (* 2 (mod v_~n~0_187 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_180 (* v_~x2~0_245 4))))) (and (not (= (ite (and (< v_~x1~0_321 v_~size~0_188) (<= 0 v_~x1~0_321)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_183|) |v_thread2Thread1of1ForFork1_~i~1#1_182|) (= |v_thread1Thread1of1ForFork0_~i~0#1_242| (+ |v_thread1Thread1of1ForFork0_~i~0#1_243| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_242| 4294967295) 4294967296) .cse0) (= v_~x2~0_244 (select .cse1 (+ v_~f~0.offset_180 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| (ite (and (< .cse3 v_~size~0_188) (<= 0 .cse3)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_243| 4294967296) .cse0) (= v_~x1~0_320 (select .cse1 (+ v_~f~0.offset_180 (* .cse3 4)))) (not (= (ite (and (< v_~x2~0_245 v_~size~0_188) (<= 0 v_~x2~0_245)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_183| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_188)) 1 0))))) InVars {~x2~0=v_~x2~0_245, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_243|, #memory_int=|v_#memory_int_270|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_183|, ~n~0=v_~n~0_187, ~x1~0=v_~x1~0_321, ~f~0.offset=v_~f~0.offset_180} OutVars{~x2~0=v_~x2~0_244, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_182|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_182|, ~x1~0=v_~x1~0_320, ~f~0.offset=v_~f~0.offset_180, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_242|, #memory_int=|v_#memory_int_270|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_109|, ~n~0=v_~n~0_187, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_190|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:38,598 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:47:38,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1390 [2022-12-06 05:47:38,598 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 307 transitions, 7492 flow [2022-12-06 05:47:38,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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 05:47:38,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:38,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:38,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:38,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 05:47:38,805 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash -270523783, now seen corresponding path program 2 times [2022-12-06 05:47:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:38,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554114623] [2022-12-06 05:47:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:38,874 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 05:47:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:38,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554114623] [2022-12-06 05:47:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554114623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:38,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:38,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:47:38,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588979550] [2022-12-06 05:47:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:38,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:38,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 05:47:38,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 307 transitions, 7492 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:38,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:38,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 05:47:38,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:39,652 INFO L130 PetriNetUnfolder]: 1528/2930 cut-off events. [2022-12-06 05:47:39,652 INFO L131 PetriNetUnfolder]: For 130020/130020 co-relation queries the response was YES. [2022-12-06 05:47:39,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32956 conditions, 2930 events. 1528/2930 cut-off events. For 130020/130020 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 20275 event pairs, 707 based on Foata normal form. 4/2932 useless extension candidates. Maximal degree in co-relation 31099. Up to 2899 conditions per place. [2022-12-06 05:47:39,678 INFO L137 encePairwiseOnDemand]: 56/67 looper letters, 298 selfloop transitions, 10 changer transitions 9/317 dead transitions. [2022-12-06 05:47:39,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 317 transitions, 8224 flow [2022-12-06 05:47:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:47:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:47:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-06 05:47:39,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2417910447761194 [2022-12-06 05:47:39,679 INFO L175 Difference]: Start difference. First operand has 228 places, 307 transitions, 7492 flow. Second operand 5 states and 81 transitions. [2022-12-06 05:47:39,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 317 transitions, 8224 flow [2022-12-06 05:47:40,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 317 transitions, 7722 flow, removed 182 selfloop flow, removed 6 redundant places. [2022-12-06 05:47:40,032 INFO L231 Difference]: Finished difference. Result has 227 places, 305 transitions, 6951 flow [2022-12-06 05:47:40,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=6971, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6951, PETRI_PLACES=227, PETRI_TRANSITIONS=305} [2022-12-06 05:47:40,032 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2022-12-06 05:47:40,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:40,033 INFO L89 Accepts]: Start accepts. Operand has 227 places, 305 transitions, 6951 flow [2022-12-06 05:47:40,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:40,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:40,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 305 transitions, 6951 flow [2022-12-06 05:47:40,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 305 transitions, 6951 flow [2022-12-06 05:47:40,200 INFO L130 PetriNetUnfolder]: 367/1194 cut-off events. [2022-12-06 05:47:40,200 INFO L131 PetriNetUnfolder]: For 49756/49902 co-relation queries the response was YES. [2022-12-06 05:47:40,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12415 conditions, 1194 events. 367/1194 cut-off events. For 49756/49902 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10233 event pairs, 62 based on Foata normal form. 11/1171 useless extension candidates. Maximal degree in co-relation 11506. Up to 392 conditions per place. [2022-12-06 05:47:40,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 305 transitions, 6951 flow [2022-12-06 05:47:40,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-06 05:47:40,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_459| v_~f~0.base_344))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_344 (* v_~x2~0_481 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_344 (* v_~x1~0_742 4))))) (let ((.cse5 (select .cse6 (+ (* .cse1 4) v_~f~0.offset_344))) (.cse4 (select .cse6 (+ v_~f~0.offset_344 (* .cse0 4))))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_344 (* .cse4 4)))) (.cse3 (select .cse6 (+ v_~f~0.offset_344 (* .cse5 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_352)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_742) (< v_~x1~0_742 v_~size~0_352)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_352) (<= 0 .cse1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| (ite (and (< .cse2 v_~size~0_352) (<= 0 .cse2)) 1 0)) (= (ite (and (< .cse3 v_~size~0_352) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426|) (not (= (ite (and (< .cse4 v_~size~0_352) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_384| 4) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_352)) 1 0) 0)) (= v_~x2~0_479 (select .cse6 (+ v_~f~0.offset_344 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_608| 4) (= (select .cse6 (+ v_~f~0.offset_344 (* .cse3 4))) v_~x1~0_740) (not (= (ite (and (< v_~x2~0_481 v_~size~0_352) (<= 0 v_~x2~0_481)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_608| 4294967294) 4294967296) (* (mod v_~n~0_351 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|)))))) InVars {~x2~0=v_~x2~0_481, ~size~0=v_~size~0_352, ~f~0.base=v_~f~0.base_344, #memory_int=|v_#memory_int_459|, ~n~0=v_~n~0_351, ~x1~0=v_~x1~0_742, ~f~0.offset=v_~f~0.offset_344} OutVars{~x2~0=v_~x2~0_479, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_444|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_253|, ~size~0=v_~size~0_352, ~f~0.base=v_~f~0.base_344, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_257|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_384|, ~x1~0=v_~x1~0_740, ~f~0.offset=v_~f~0.offset_344, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_608|, #memory_int=|v_#memory_int_459|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_243|, ~n~0=v_~n~0_351, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_243|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_452|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:41,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_459| v_~f~0.base_344))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_344 (* v_~x2~0_481 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_344 (* v_~x1~0_742 4))))) (let ((.cse5 (select .cse6 (+ (* .cse1 4) v_~f~0.offset_344))) (.cse4 (select .cse6 (+ v_~f~0.offset_344 (* .cse0 4))))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_344 (* .cse4 4)))) (.cse3 (select .cse6 (+ v_~f~0.offset_344 (* .cse5 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_352)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_742) (< v_~x1~0_742 v_~size~0_352)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_352) (<= 0 .cse1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| (ite (and (< .cse2 v_~size~0_352) (<= 0 .cse2)) 1 0)) (= (ite (and (< .cse3 v_~size~0_352) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426|) (not (= (ite (and (< .cse4 v_~size~0_352) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_384| 4) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_352)) 1 0) 0)) (= v_~x2~0_479 (select .cse6 (+ v_~f~0.offset_344 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_608| 4) (= (select .cse6 (+ v_~f~0.offset_344 (* .cse3 4))) v_~x1~0_740) (not (= (ite (and (< v_~x2~0_481 v_~size~0_352) (<= 0 v_~x2~0_481)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_608| 4294967294) 4294967296) (* (mod v_~n~0_351 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|)))))) InVars {~x2~0=v_~x2~0_481, ~size~0=v_~size~0_352, ~f~0.base=v_~f~0.base_344, #memory_int=|v_#memory_int_459|, ~n~0=v_~n~0_351, ~x1~0=v_~x1~0_742, ~f~0.offset=v_~f~0.offset_344} OutVars{~x2~0=v_~x2~0_479, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_444|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_253|, ~size~0=v_~size~0_352, ~f~0.base=v_~f~0.base_344, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_257|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_384|, ~x1~0=v_~x1~0_740, ~f~0.offset=v_~f~0.offset_344, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_608|, #memory_int=|v_#memory_int_459|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_243|, ~n~0=v_~n~0_351, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_243|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_452|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:41,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_459| v_~f~0.base_344))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_344 (* v_~x2~0_481 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_344 (* v_~x1~0_742 4))))) (let ((.cse5 (select .cse6 (+ (* .cse1 4) v_~f~0.offset_344))) (.cse4 (select .cse6 (+ v_~f~0.offset_344 (* .cse0 4))))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_344 (* .cse4 4)))) (.cse3 (select .cse6 (+ v_~f~0.offset_344 (* .cse5 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_352)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_742) (< v_~x1~0_742 v_~size~0_352)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_352) (<= 0 .cse1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| (ite (and (< .cse2 v_~size~0_352) (<= 0 .cse2)) 1 0)) (= (ite (and (< .cse3 v_~size~0_352) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426|) (not (= (ite (and (< .cse4 v_~size~0_352) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_384| 4) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_352)) 1 0) 0)) (= v_~x2~0_479 (select .cse6 (+ v_~f~0.offset_344 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_608| 4) (= (select .cse6 (+ v_~f~0.offset_344 (* .cse3 4))) v_~x1~0_740) (not (= (ite (and (< v_~x2~0_481 v_~size~0_352) (<= 0 v_~x2~0_481)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_608| 4294967294) 4294967296) (* (mod v_~n~0_351 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|)))))) InVars {~x2~0=v_~x2~0_481, ~size~0=v_~size~0_352, ~f~0.base=v_~f~0.base_344, #memory_int=|v_#memory_int_459|, ~n~0=v_~n~0_351, ~x1~0=v_~x1~0_742, ~f~0.offset=v_~f~0.offset_344} OutVars{~x2~0=v_~x2~0_479, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_444|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_253|, ~size~0=v_~size~0_352, ~f~0.base=v_~f~0.base_344, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_257|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_384|, ~x1~0=v_~x1~0_740, ~f~0.offset=v_~f~0.offset_344, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_608|, #memory_int=|v_#memory_int_459|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_243|, ~n~0=v_~n~0_351, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_243|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_452|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [669] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_278| v_~f~0.base_188))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_188 (* v_~x1~0_339 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_188 (* v_~x2~0_262 4)))) (.cse0 (* 2 (mod v_~n~0_195 2147483648))) (.cse3 (select .cse1 (+ v_~f~0.offset_188 (* .cse4 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_166| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_199| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_200|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_200| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_166|) (= v_~x2~0_261 (select .cse1 (+ v_~f~0.offset_188 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_174| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|) (= (ite (and (< .cse3 v_~size~0_196) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_174|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_260| 4294967295) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| (ite (and (< .cse2 v_~size~0_196) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_262) (< v_~x2~0_262 v_~size~0_196)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_261| 4294967296) .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_261| 3) |v_thread1Thread1of1ForFork0_~i~0#1_260|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_339 v_~size~0_196) (<= 0 v_~x1~0_339)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190| 0)) (= v_~x1~0_338 (select .cse1 (+ v_~f~0.offset_188 (* .cse3 4)))))))) InVars {~x2~0=v_~x2~0_262, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_188, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, #memory_int=|v_#memory_int_278|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_200|, ~n~0=v_~n~0_195, ~x1~0=v_~x1~0_339, ~f~0.offset=v_~f~0.offset_188} OutVars{~x2~0=v_~x2~0_261, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_192|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_128|, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_188, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_132|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_199|, ~x1~0=v_~x1~0_338, ~f~0.offset=v_~f~0.offset_188, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_174|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_260|, #memory_int=|v_#memory_int_278|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_118|, ~n~0=v_~n~0_195, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_118|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_200|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:42,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:42,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2228 [2022-12-06 05:47:42,260 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 305 transitions, 7039 flow [2022-12-06 05:47:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:42,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:42,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:42,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 05:47:42,261 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1475375645, now seen corresponding path program 1 times [2022-12-06 05:47:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:42,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139963659] [2022-12-06 05:47:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:42,291 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 05:47:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:42,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139963659] [2022-12-06 05:47:42,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139963659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:42,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:42,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937530415] [2022-12-06 05:47:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:42,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:42,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:42,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 05:47:42,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 305 transitions, 7039 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:42,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:42,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 05:47:42,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:42,980 INFO L130 PetriNetUnfolder]: 1518/2907 cut-off events. [2022-12-06 05:47:42,981 INFO L131 PetriNetUnfolder]: For 120578/120578 co-relation queries the response was YES. [2022-12-06 05:47:42,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31568 conditions, 2907 events. 1518/2907 cut-off events. For 120578/120578 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 20051 event pairs, 616 based on Foata normal form. 2/2905 useless extension candidates. Maximal degree in co-relation 29721. Up to 2492 conditions per place. [2022-12-06 05:47:43,009 INFO L137 encePairwiseOnDemand]: 55/70 looper letters, 267 selfloop transitions, 49 changer transitions 1/317 dead transitions. [2022-12-06 05:47:43,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 317 transitions, 7877 flow [2022-12-06 05:47:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-06 05:47:43,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2022-12-06 05:47:43,010 INFO L175 Difference]: Start difference. First operand has 225 places, 305 transitions, 7039 flow. Second operand 3 states and 79 transitions. [2022-12-06 05:47:43,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 317 transitions, 7877 flow [2022-12-06 05:47:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 317 transitions, 7757 flow, removed 50 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:43,316 INFO L231 Difference]: Finished difference. Result has 224 places, 303 transitions, 6944 flow [2022-12-06 05:47:43,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=6882, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6944, PETRI_PLACES=224, PETRI_TRANSITIONS=303} [2022-12-06 05:47:43,317 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 203 predicate places. [2022-12-06 05:47:43,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:43,317 INFO L89 Accepts]: Start accepts. Operand has 224 places, 303 transitions, 6944 flow [2022-12-06 05:47:43,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:43,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:43,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 303 transitions, 6944 flow [2022-12-06 05:47:43,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 303 transitions, 6944 flow [2022-12-06 05:47:43,481 INFO L130 PetriNetUnfolder]: 366/1188 cut-off events. [2022-12-06 05:47:43,481 INFO L131 PetriNetUnfolder]: For 50391/50537 co-relation queries the response was YES. [2022-12-06 05:47:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12422 conditions, 1188 events. 366/1188 cut-off events. For 50391/50537 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10168 event pairs, 62 based on Foata normal form. 11/1166 useless extension candidates. Maximal degree in co-relation 11567. Up to 388 conditions per place. [2022-12-06 05:47:43,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 303 transitions, 6944 flow [2022-12-06 05:47:43,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-06 05:47:43,498 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:43,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:47:43,499 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 303 transitions, 6944 flow [2022-12-06 05:47:43,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:43,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:43,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:43,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 05:47:43,499 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash -306075989, now seen corresponding path program 1 times [2022-12-06 05:47:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:43,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121883349] [2022-12-06 05:47:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:43,562 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 05:47:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:43,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121883349] [2022-12-06 05:47:43,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121883349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:43,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:43,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870837971] [2022-12-06 05:47:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:43,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:43,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:43,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:43,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 05:47:43,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 303 transitions, 6944 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:47:43,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:43,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 05:47:43,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:44,290 INFO L130 PetriNetUnfolder]: 1527/2922 cut-off events. [2022-12-06 05:47:44,290 INFO L131 PetriNetUnfolder]: For 122399/122399 co-relation queries the response was YES. [2022-12-06 05:47:44,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31794 conditions, 2922 events. 1527/2922 cut-off events. For 122399/122399 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 20160 event pairs, 704 based on Foata normal form. 8/2928 useless extension candidates. Maximal degree in co-relation 29947. Up to 2881 conditions per place. [2022-12-06 05:47:44,319 INFO L137 encePairwiseOnDemand]: 63/68 looper letters, 300 selfloop transitions, 10 changer transitions 1/311 dead transitions. [2022-12-06 05:47:44,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 311 transitions, 7750 flow [2022-12-06 05:47:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 05:47:44,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35784313725490197 [2022-12-06 05:47:44,320 INFO L175 Difference]: Start difference. First operand has 223 places, 303 transitions, 6944 flow. Second operand 3 states and 73 transitions. [2022-12-06 05:47:44,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 311 transitions, 7750 flow [2022-12-06 05:47:44,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 311 transitions, 7646 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:44,643 INFO L231 Difference]: Finished difference. Result has 224 places, 304 transitions, 6918 flow [2022-12-06 05:47:44,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=6842, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6918, PETRI_PLACES=224, PETRI_TRANSITIONS=304} [2022-12-06 05:47:44,643 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 203 predicate places. [2022-12-06 05:47:44,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:44,643 INFO L89 Accepts]: Start accepts. Operand has 224 places, 304 transitions, 6918 flow [2022-12-06 05:47:44,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:44,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:44,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 304 transitions, 6918 flow [2022-12-06 05:47:44,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 304 transitions, 6918 flow [2022-12-06 05:47:44,809 INFO L130 PetriNetUnfolder]: 369/1195 cut-off events. [2022-12-06 05:47:44,809 INFO L131 PetriNetUnfolder]: For 52083/52229 co-relation queries the response was YES. [2022-12-06 05:47:44,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12613 conditions, 1195 events. 369/1195 cut-off events. For 52083/52229 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10261 event pairs, 62 based on Foata normal form. 11/1173 useless extension candidates. Maximal degree in co-relation 11745. Up to 393 conditions per place. [2022-12-06 05:47:44,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 304 transitions, 6918 flow [2022-12-06 05:47:44,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 852 [2022-12-06 05:47:44,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:44,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 05:47:44,858 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 304 transitions, 6918 flow [2022-12-06 05:47:44,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:47:44,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:44,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:44,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 05:47:44,858 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:44,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash -632102732, now seen corresponding path program 1 times [2022-12-06 05:47:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:44,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144563136] [2022-12-06 05:47:44,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:44,896 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 05:47:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:44,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144563136] [2022-12-06 05:47:44,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144563136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:44,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:44,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719138339] [2022-12-06 05:47:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:44,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:44,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:44,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 05:47:44,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 304 transitions, 6918 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:44,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:44,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 05:47:44,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:45,596 INFO L130 PetriNetUnfolder]: 1540/2945 cut-off events. [2022-12-06 05:47:45,596 INFO L131 PetriNetUnfolder]: For 127083/127083 co-relation queries the response was YES. [2022-12-06 05:47:45,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32246 conditions, 2945 events. 1540/2945 cut-off events. For 127083/127083 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 20325 event pairs, 671 based on Foata normal form. 6/2949 useless extension candidates. Maximal degree in co-relation 30394. Up to 2699 conditions per place. [2022-12-06 05:47:45,625 INFO L137 encePairwiseOnDemand]: 32/68 looper letters, 243 selfloop transitions, 77 changer transitions 1/321 dead transitions. [2022-12-06 05:47:45,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 321 transitions, 7879 flow [2022-12-06 05:47:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-06 05:47:45,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2022-12-06 05:47:45,626 INFO L175 Difference]: Start difference. First operand has 224 places, 304 transitions, 6918 flow. Second operand 3 states and 75 transitions. [2022-12-06 05:47:45,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 321 transitions, 7879 flow [2022-12-06 05:47:45,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 321 transitions, 7855 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:45,965 INFO L231 Difference]: Finished difference. Result has 226 places, 307 transitions, 7229 flow [2022-12-06 05:47:45,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=6894, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7229, PETRI_PLACES=226, PETRI_TRANSITIONS=307} [2022-12-06 05:47:45,965 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 205 predicate places. [2022-12-06 05:47:45,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:45,965 INFO L89 Accepts]: Start accepts. Operand has 226 places, 307 transitions, 7229 flow [2022-12-06 05:47:45,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:45,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:45,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 307 transitions, 7229 flow [2022-12-06 05:47:45,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 307 transitions, 7229 flow [2022-12-06 05:47:46,145 INFO L130 PetriNetUnfolder]: 373/1204 cut-off events. [2022-12-06 05:47:46,146 INFO L131 PetriNetUnfolder]: For 55322/55468 co-relation queries the response was YES. [2022-12-06 05:47:46,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13000 conditions, 1204 events. 373/1204 cut-off events. For 55322/55468 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 10306 event pairs, 62 based on Foata normal form. 11/1182 useless extension candidates. Maximal degree in co-relation 12104. Up to 399 conditions per place. [2022-12-06 05:47:46,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 307 transitions, 7229 flow [2022-12-06 05:47:46,163 INFO L188 LiptonReduction]: Number of co-enabled transitions 858 [2022-12-06 05:47:46,164 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:46,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:47:46,165 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 307 transitions, 7229 flow [2022-12-06 05:47:46,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:47:46,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:46,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:46,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 05:47:46,165 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:46,165 INFO L85 PathProgramCache]: Analyzing trace with hash -17011036, now seen corresponding path program 1 times [2022-12-06 05:47:46,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:46,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226543577] [2022-12-06 05:47:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:46,213 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 05:47:46,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:46,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226543577] [2022-12-06 05:47:46,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226543577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:46,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571733526] [2022-12-06 05:47:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:46,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:46,215 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:46,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 05:47:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:46,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:47:46,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:46,457 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 05:47:46,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:46,485 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 05:47:46,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571733526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:46,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:46,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-12-06 05:47:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818273151] [2022-12-06 05:47:46,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:46,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:47:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:47:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:47:46,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 05:47:46,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 307 transitions, 7229 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:47:46,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:46,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 05:47:46,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:47,454 INFO L130 PetriNetUnfolder]: 1554/2964 cut-off events. [2022-12-06 05:47:47,454 INFO L131 PetriNetUnfolder]: For 135811/135811 co-relation queries the response was YES. [2022-12-06 05:47:47,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33168 conditions, 2964 events. 1554/2964 cut-off events. For 135811/135811 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 20376 event pairs, 591 based on Foata normal form. 22/2984 useless extension candidates. Maximal degree in co-relation 31287. Up to 2498 conditions per place. [2022-12-06 05:47:47,481 INFO L137 encePairwiseOnDemand]: 29/68 looper letters, 223 selfloop transitions, 120 changer transitions 4/347 dead transitions. [2022-12-06 05:47:47,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 347 transitions, 8662 flow [2022-12-06 05:47:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:47:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:47:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2022-12-06 05:47:47,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15441176470588236 [2022-12-06 05:47:47,484 INFO L175 Difference]: Start difference. First operand has 226 places, 307 transitions, 7229 flow. Second operand 10 states and 105 transitions. [2022-12-06 05:47:47,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 347 transitions, 8662 flow [2022-12-06 05:47:47,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 347 transitions, 8559 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:47,819 INFO L231 Difference]: Finished difference. Result has 238 places, 321 transitions, 7870 flow [2022-12-06 05:47:47,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=7129, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7870, PETRI_PLACES=238, PETRI_TRANSITIONS=321} [2022-12-06 05:47:47,820 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 217 predicate places. [2022-12-06 05:47:47,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:47,820 INFO L89 Accepts]: Start accepts. Operand has 238 places, 321 transitions, 7870 flow [2022-12-06 05:47:47,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:47,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:47,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 321 transitions, 7870 flow [2022-12-06 05:47:47,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 321 transitions, 7870 flow [2022-12-06 05:47:48,006 INFO L130 PetriNetUnfolder]: 377/1206 cut-off events. [2022-12-06 05:47:48,006 INFO L131 PetriNetUnfolder]: For 59372/59520 co-relation queries the response was YES. [2022-12-06 05:47:48,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13616 conditions, 1206 events. 377/1206 cut-off events. For 59372/59520 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 10302 event pairs, 60 based on Foata normal form. 11/1184 useless extension candidates. Maximal degree in co-relation 12632. Up to 405 conditions per place. [2022-12-06 05:47:48,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 321 transitions, 7870 flow [2022-12-06 05:47:48,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-06 05:47:48,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [802] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_463| v_~f~0.base_348))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_348 (* v_~x1~0_752 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_348 (* .cse6 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_348 (* 4 .cse8)))) (.cse5 (select .cse3 (+ v_~f~0.offset_348 (* v_~x2~0_492 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_348 (* 4 .cse5)))) (.cse4 (select .cse3 (+ v_~f~0.offset_348 (* 4 .cse7))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_348 (* .cse4 4)))) (.cse1 (select .cse3 (+ v_~f~0.offset_348 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_356) (<= 0 .cse0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_614| 6) (not (= (ite (and (< v_~x2~0_492 v_~size~0_356) (<= 0 v_~x2~0_492)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_275| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_356)) 1 0)) (< 4 (* (mod v_~n~0_355 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448| 0)) (= (ite (and (< .cse2 v_~size~0_356) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_432|) (= v_~x1~0_750 (select .cse3 (+ v_~f~0.offset_348 (* .cse2 4)))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_356)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_356) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_432| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448|) (not (= (ite (and (< .cse6 v_~size~0_356) (<= 0 .cse6)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_392| 4) (not (= (ite (and (< v_~x1~0_752 v_~size~0_356) (<= 0 v_~x1~0_752)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_356) (<= 0 .cse7)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_348 (* .cse1 4))) v_~x2~0_491) (not (= (ite (and (< .cse8 v_~size~0_356) (<= 0 .cse8)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_275| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299|)))))))) InVars {~x2~0=v_~x2~0_492, ~size~0=v_~size~0_356, ~f~0.base=v_~f~0.base_348, #memory_int=|v_#memory_int_463|, ~n~0=v_~n~0_355, ~x1~0=v_~x1~0_752, ~f~0.offset=v_~f~0.offset_348} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_450|, ~x2~0=v_~x2~0_491, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_261|, ~size~0=v_~size~0_356, ~f~0.base=v_~f~0.base_348, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_265|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_275|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_392|, ~x1~0=v_~x1~0_750, ~f~0.offset=v_~f~0.offset_348, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_432|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_614|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448|, #memory_int=|v_#memory_int_463|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_251|, ~n~0=v_~n~0_355, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_458|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_251|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:48,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [671] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_280| v_~f~0.base_190))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_190 (* v_~x1~0_344 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_190 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_190 (* v_~x2~0_266 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse5)))) (.cse4 (select .cse0 (+ v_~f~0.offset_190 (* .cse7 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_190 (* .cse4 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_190 (* .cse6 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_192| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_203| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_168| 0)) (= v_~x2~0_265 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse1)))) (= (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse2))) v_~x1~0_342) (not (= (ite (and (<= 0 v_~x1~0_344) (< v_~x1~0_344 v_~size~0_198)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_168|) (not (= (ite (and (< .cse3 v_~size~0_198) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_264| 5) (not (= (ite (and (< .cse4 v_~size~0_198) (<= 0 .cse4)) 1 0) 0)) (not (= 0 (ite (and (< .cse5 v_~size~0_198) (<= 0 .cse5)) 1 0))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_264| 4294967295) 4294967296) (* (mod v_~n~0_197 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176| (ite (and (< .cse2 v_~size~0_198) (<= 0 .cse2)) 1 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_266) (< v_~x2~0_266 v_~size~0_198)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_198)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_192|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_198)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_198)) 1 0))))))))) InVars {~x2~0=v_~x2~0_266, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_190, #memory_int=|v_#memory_int_280|, ~n~0=v_~n~0_197, ~x1~0=v_~x1~0_344, ~f~0.offset=v_~f~0.offset_190} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_194|, ~x2~0=v_~x2~0_265, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_130|, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_190, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_134|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_203|, ~x1~0=v_~x1~0_342, ~f~0.offset=v_~f~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_168|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_264|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_192|, #memory_int=|v_#memory_int_280|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_120|, ~n~0=v_~n~0_197, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_202|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_120|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:49,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [673] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_282| v_~f~0.base_192))) (let ((.cse0 (* (mod v_~n~0_199 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_192 (* v_~x1~0_352 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_273| 1) 4294967296) .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_273| 2) |v_thread1Thread1of1ForFork0_~i~0#1_271|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_182| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_198|) (= (select .cse1 (+ v_~f~0.offset_192 (* .cse2 4))) v_~x1~0_350) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_273| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_182| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_200)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_198| 0)) (not (= (ite (and (< v_~x1~0_352 v_~size~0_200) (<= 0 v_~x1~0_352)) 1 0) 0))))) InVars {~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_192, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_273|, #memory_int=|v_#memory_int_282|, ~n~0=v_~n~0_199, ~x1~0=v_~x1~0_352, ~f~0.offset=v_~f~0.offset_192} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_200|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_182|, ~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_192, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_271|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_198|, #memory_int=|v_#memory_int_282|, ~n~0=v_~n~0_199, ~x1~0=v_~x1~0_350, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_208|, ~f~0.offset=v_~f~0.offset_192} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [677] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_286| v_~f~0.base_196))) (let ((.cse0 (* 2 (mod v_~n~0_203 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_196 (* v_~x1~0_364 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_285| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_196 (* .cse2 4))) v_~x1~0_362) (= |v_thread1Thread1of1ForFork0_~i~0#1_283| (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_283| 4294967295) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_204)) 1 0)) (not (= (ite (and (< v_~x1~0_364 v_~size~0_204) (<= 0 v_~x1~0_364)) 1 0) 0))))) InVars {~size~0=v_~size~0_204, ~f~0.base=v_~f~0.base_196, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_286|, ~n~0=v_~n~0_203, ~x1~0=v_~x1~0_364, ~f~0.offset=v_~f~0.offset_196} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|, ~size~0=v_~size~0_204, ~f~0.base=v_~f~0.base_196, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_283|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|, #memory_int=|v_#memory_int_286|, ~n~0=v_~n~0_203, ~x1~0=v_~x1~0_362, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_216|, ~f~0.offset=v_~f~0.offset_196} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,158 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:47:50,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2339 [2022-12-06 05:47:50,159 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 319 transitions, 7937 flow [2022-12-06 05:47:50,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:47:50,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:50,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:50,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:50,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:50,360 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash 48455786, now seen corresponding path program 1 times [2022-12-06 05:47:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:50,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009046918] [2022-12-06 05:47:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:50,422 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 05:47:50,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:50,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009046918] [2022-12-06 05:47:50,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009046918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:50,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988863674] [2022-12-06 05:47:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:50,424 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:50,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 05:47:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:50,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-06 05:47:50,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:50,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:50,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:47:50,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:50,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:50,754 INFO L321 Elim1Store]: treesize reduction 198, result has 12.0 percent of original size [2022-12-06 05:47:50,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 213 treesize of output 86 [2022-12-06 05:47:50,784 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 05:47:50,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:51,577 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 05:47:51,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988863674] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:51,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:51,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 05:47:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290991163] [2022-12-06 05:47:51,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:51,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:47:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:47:51,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=96, Unknown=3, NotChecked=0, Total=132 [2022-12-06 05:47:51,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 05:47:51,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 319 transitions, 7937 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:47:51,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:51,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 05:47:51,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:08,277 WARN L233 SmtUtils]: Spent 14.40s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:48:25,080 WARN L233 SmtUtils]: Spent 16.48s on a formula simplification. DAG size of input: 171 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:48:51,949 WARN L233 SmtUtils]: Spent 24.48s on a formula simplification. DAG size of input: 185 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:48:53,988 INFO L130 PetriNetUnfolder]: 1727/3269 cut-off events. [2022-12-06 05:48:53,988 INFO L131 PetriNetUnfolder]: For 167194/167194 co-relation queries the response was YES. [2022-12-06 05:48:54,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38038 conditions, 3269 events. 1727/3269 cut-off events. For 167194/167194 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 22882 event pairs, 540 based on Foata normal form. 14/3281 useless extension candidates. Maximal degree in co-relation 35769. Up to 2488 conditions per place. [2022-12-06 05:48:54,019 INFO L137 encePairwiseOnDemand]: 18/73 looper letters, 229 selfloop transitions, 177 changer transitions 6/412 dead transitions. [2022-12-06 05:48:54,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 412 transitions, 10566 flow [2022-12-06 05:48:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:48:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:48:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2022-12-06 05:48:54,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14187866927592954 [2022-12-06 05:48:54,020 INFO L175 Difference]: Start difference. First operand has 236 places, 319 transitions, 7937 flow. Second operand 14 states and 145 transitions. [2022-12-06 05:48:54,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 412 transitions, 10566 flow [2022-12-06 05:48:54,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 412 transitions, 10294 flow, removed 136 selfloop flow, removed 0 redundant places. [2022-12-06 05:48:54,491 INFO L231 Difference]: Finished difference. Result has 254 places, 358 transitions, 9309 flow [2022-12-06 05:48:54,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=7685, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9309, PETRI_PLACES=254, PETRI_TRANSITIONS=358} [2022-12-06 05:48:54,491 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 233 predicate places. [2022-12-06 05:48:54,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:54,491 INFO L89 Accepts]: Start accepts. Operand has 254 places, 358 transitions, 9309 flow [2022-12-06 05:48:54,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:54,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:54,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 358 transitions, 9309 flow [2022-12-06 05:48:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 358 transitions, 9309 flow [2022-12-06 05:48:54,687 INFO L130 PetriNetUnfolder]: 419/1307 cut-off events. [2022-12-06 05:48:54,687 INFO L131 PetriNetUnfolder]: For 73784/74000 co-relation queries the response was YES. [2022-12-06 05:48:54,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15727 conditions, 1307 events. 419/1307 cut-off events. For 73784/74000 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 11321 event pairs, 74 based on Foata normal form. 12/1276 useless extension candidates. Maximal degree in co-relation 14695. Up to 454 conditions per place. [2022-12-06 05:48:54,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 358 transitions, 9309 flow [2022-12-06 05:48:54,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 1010 [2022-12-06 05:48:54,707 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_469| v_~f~0.base_354))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_354 (* v_~x1~0_771 4)))) (.cse4 (select .cse6 (+ v_~f~0.offset_354 (* v_~x2~0_508 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_354 (* .cse4 4)))) (.cse10 (select .cse6 (+ v_~f~0.offset_354 (* .cse5 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_354 (* .cse10 4)))) (.cse0 (select .cse6 (+ (* .cse9 4) v_~f~0.offset_354)))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_354 (* .cse0 4)))) (.cse8 (select .cse6 (+ v_~f~0.offset_354 (* .cse1 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_354 (* .cse8 4)))) (.cse7 (select .cse6 (+ v_~f~0.offset_354 (* .cse2 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_362)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_362)) 1 0) 0)) (< 4 (* (mod v_~n~0_361 2147483648) 2)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_362)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_446| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_462|) (= |v_thread1Thread1of1ForFork0_~i~0#1_629| 6) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_446| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_362)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|) (not (= (ite (and (< .cse4 v_~size~0_362) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_508 v_~size~0_362) (<= 0 v_~x2~0_508)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_771 v_~size~0_362) (<= 0 v_~x1~0_771)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_401|) (= v_~x2~0_506 (select .cse6 (+ v_~f~0.offset_354 (* .cse7 4)))) (not (= (ite (and (< .cse8 v_~size~0_362) (<= 0 .cse8)) 1 0) 0)) (= v_~x1~0_770 (select .cse6 (+ v_~f~0.offset_354 (* .cse3 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_462| 0)) (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_362)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_362) (<= 0 .cse10)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_508, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_354, #memory_int=|v_#memory_int_469|, ~n~0=v_~n~0_361, ~x1~0=v_~x1~0_771, ~f~0.offset=v_~f~0.offset_354} OutVars{~x2~0=v_~x2~0_506, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_464|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_270|, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_354, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_274|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_401|, ~x1~0=v_~x1~0_770, ~f~0.offset=v_~f~0.offset_354, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_446|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_629|, #memory_int=|v_#memory_int_469|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_462|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_260|, ~n~0=v_~n~0_361, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_260|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_472|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:55,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_469| v_~f~0.base_354))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_354 (* v_~x1~0_771 4)))) (.cse4 (select .cse6 (+ v_~f~0.offset_354 (* v_~x2~0_508 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_354 (* .cse4 4)))) (.cse10 (select .cse6 (+ v_~f~0.offset_354 (* .cse5 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_354 (* .cse10 4)))) (.cse0 (select .cse6 (+ (* .cse9 4) v_~f~0.offset_354)))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_354 (* .cse0 4)))) (.cse8 (select .cse6 (+ v_~f~0.offset_354 (* .cse1 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_354 (* .cse8 4)))) (.cse7 (select .cse6 (+ v_~f~0.offset_354 (* .cse2 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_362)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_362)) 1 0) 0)) (< 4 (* (mod v_~n~0_361 2147483648) 2)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_362)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_446| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_462|) (= |v_thread1Thread1of1ForFork0_~i~0#1_629| 6) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_446| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_362)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|) (not (= (ite (and (< .cse4 v_~size~0_362) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_508 v_~size~0_362) (<= 0 v_~x2~0_508)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_771 v_~size~0_362) (<= 0 v_~x1~0_771)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_401|) (= v_~x2~0_506 (select .cse6 (+ v_~f~0.offset_354 (* .cse7 4)))) (not (= (ite (and (< .cse8 v_~size~0_362) (<= 0 .cse8)) 1 0) 0)) (= v_~x1~0_770 (select .cse6 (+ v_~f~0.offset_354 (* .cse3 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_462| 0)) (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_362)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_362) (<= 0 .cse10)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_508, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_354, #memory_int=|v_#memory_int_469|, ~n~0=v_~n~0_361, ~x1~0=v_~x1~0_771, ~f~0.offset=v_~f~0.offset_354} OutVars{~x2~0=v_~x2~0_506, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_464|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_270|, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_354, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_274|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_401|, ~x1~0=v_~x1~0_770, ~f~0.offset=v_~f~0.offset_354, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_446|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_629|, #memory_int=|v_#memory_int_469|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_462|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_260|, ~n~0=v_~n~0_361, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_260|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_472|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:56,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_304| v_~f~0.base_208))) (let ((.cse0 (* 2 (mod v_~n~0_215 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_208 (* v_~x1~0_396 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_313| 4294967295) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_210| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226| 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_315| 2) |v_thread1Thread1of1ForFork0_~i~0#1_313|) (not (= (ite (and (<= 0 v_~x1~0_396) (< v_~x1~0_396 v_~size~0_216)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_315| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_208 (* .cse2 4))) v_~x1~0_394) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_210| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_216)) 1 0))))) InVars {~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_215, ~x1~0=v_~x1~0_396, ~f~0.offset=v_~f~0.offset_208} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_210|, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226|, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_215, ~x1~0=v_~x1~0_394, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_236|, ~f~0.offset=v_~f~0.offset_208} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:57,461 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:48:57,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2974 [2022-12-06 05:48:57,465 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 358 transitions, 9402 flow [2022-12-06 05:48:57,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 05:48:57,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:57,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:57,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 05:48:57,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:57,672 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 815204081, now seen corresponding path program 1 times [2022-12-06 05:48:57,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:57,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024233831] [2022-12-06 05:48:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:57,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:57,728 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 05:48:57,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:57,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024233831] [2022-12-06 05:48:57,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024233831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:48:57,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:48:57,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:48:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232153999] [2022-12-06 05:48:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:48:57,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:48:57,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:48:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:48:57,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-06 05:48:57,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 358 transitions, 9402 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:48:57,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:57,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-06 05:48:57,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:58,561 INFO L130 PetriNetUnfolder]: 1740/3296 cut-off events. [2022-12-06 05:48:58,561 INFO L131 PetriNetUnfolder]: For 180550/180550 co-relation queries the response was YES. [2022-12-06 05:48:58,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40206 conditions, 3296 events. 1740/3296 cut-off events. For 180550/180550 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 22919 event pairs, 833 based on Foata normal form. 14/3308 useless extension candidates. Maximal degree in co-relation 37778. Up to 3275 conditions per place. [2022-12-06 05:48:58,592 INFO L137 encePairwiseOnDemand]: 70/77 looper letters, 355 selfloop transitions, 10 changer transitions 1/366 dead transitions. [2022-12-06 05:48:58,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 366 transitions, 10318 flow [2022-12-06 05:48:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:48:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:48:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-06 05:48:58,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 05:48:58,594 INFO L175 Difference]: Start difference. First operand has 254 places, 358 transitions, 9402 flow. Second operand 3 states and 84 transitions. [2022-12-06 05:48:58,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 366 transitions, 10318 flow [2022-12-06 05:48:59,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 366 transitions, 9877 flow, removed 189 selfloop flow, removed 4 redundant places. [2022-12-06 05:48:59,045 INFO L231 Difference]: Finished difference. Result has 253 places, 361 transitions, 9111 flow [2022-12-06 05:48:59,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=8965, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=9111, PETRI_PLACES=253, PETRI_TRANSITIONS=361} [2022-12-06 05:48:59,046 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 232 predicate places. [2022-12-06 05:48:59,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:59,046 INFO L89 Accepts]: Start accepts. Operand has 253 places, 361 transitions, 9111 flow [2022-12-06 05:48:59,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:59,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:59,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 361 transitions, 9111 flow [2022-12-06 05:48:59,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 361 transitions, 9111 flow [2022-12-06 05:48:59,258 INFO L130 PetriNetUnfolder]: 421/1315 cut-off events. [2022-12-06 05:48:59,258 INFO L131 PetriNetUnfolder]: For 71476/71630 co-relation queries the response was YES. [2022-12-06 05:48:59,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15601 conditions, 1315 events. 421/1315 cut-off events. For 71476/71630 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11418 event pairs, 75 based on Foata normal form. 4/1280 useless extension candidates. Maximal degree in co-relation 14701. Up to 457 conditions per place. [2022-12-06 05:48:59,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 361 transitions, 9111 flow [2022-12-06 05:48:59,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-06 05:48:59,275 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:48:59,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 05:48:59,276 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 361 transitions, 9111 flow [2022-12-06 05:48:59,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:48:59,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:59,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:59,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 05:48:59,276 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash 655455802, now seen corresponding path program 1 times [2022-12-06 05:48:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241106758] [2022-12-06 05:48:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:59,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:00,527 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 05:49:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:00,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241106758] [2022-12-06 05:49:00,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241106758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:00,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492018224] [2022-12-06 05:49:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:00,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:00,529 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:00,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 05:49:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:00,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:49:00,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:00,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:00,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 152 [2022-12-06 05:49:00,975 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 05:49:00,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:02,531 INFO L321 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2022-12-06 05:49:02,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 99 treesize of output 666 [2022-12-06 05:49:12,338 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 05:49:12,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492018224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:12,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:12,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:49:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677245224] [2022-12-06 05:49:12,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:12,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:49:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:49:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:49:12,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-06 05:49:12,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 361 transitions, 9111 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:12,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:12,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-06 05:49:12,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:14,638 INFO L130 PetriNetUnfolder]: 2103/3975 cut-off events. [2022-12-06 05:49:14,638 INFO L131 PetriNetUnfolder]: For 227573/227573 co-relation queries the response was YES. [2022-12-06 05:49:14,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49369 conditions, 3975 events. 2103/3975 cut-off events. For 227573/227573 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 28712 event pairs, 457 based on Foata normal form. 8/3981 useless extension candidates. Maximal degree in co-relation 46932. Up to 2381 conditions per place. [2022-12-06 05:49:14,678 INFO L137 encePairwiseOnDemand]: 25/77 looper letters, 261 selfloop transitions, 201 changer transitions 8/470 dead transitions. [2022-12-06 05:49:14,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 470 transitions, 12436 flow [2022-12-06 05:49:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:49:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:49:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-12-06 05:49:14,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20202020202020202 [2022-12-06 05:49:14,680 INFO L175 Difference]: Start difference. First operand has 252 places, 361 transitions, 9111 flow. Second operand 9 states and 140 transitions. [2022-12-06 05:49:14,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 470 transitions, 12436 flow [2022-12-06 05:49:15,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 470 transitions, 12328 flow, removed 49 selfloop flow, removed 1 redundant places. [2022-12-06 05:49:15,352 INFO L231 Difference]: Finished difference. Result has 263 places, 412 transitions, 11169 flow [2022-12-06 05:49:15,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=9003, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11169, PETRI_PLACES=263, PETRI_TRANSITIONS=412} [2022-12-06 05:49:15,352 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 242 predicate places. [2022-12-06 05:49:15,352 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:15,352 INFO L89 Accepts]: Start accepts. Operand has 263 places, 412 transitions, 11169 flow [2022-12-06 05:49:15,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:15,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:15,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 412 transitions, 11169 flow [2022-12-06 05:49:15,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 412 transitions, 11169 flow [2022-12-06 05:49:15,628 INFO L130 PetriNetUnfolder]: 513/1579 cut-off events. [2022-12-06 05:49:15,628 INFO L131 PetriNetUnfolder]: For 98485/98749 co-relation queries the response was YES. [2022-12-06 05:49:15,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20119 conditions, 1579 events. 513/1579 cut-off events. For 98485/98749 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 14184 event pairs, 97 based on Foata normal form. 5/1529 useless extension candidates. Maximal degree in co-relation 18946. Up to 576 conditions per place. [2022-12-06 05:49:15,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 412 transitions, 11169 flow [2022-12-06 05:49:15,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-06 05:49:15,653 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:15,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-06 05:49:15,653 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 412 transitions, 11169 flow [2022-12-06 05:49:15,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:15,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:15,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:15,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 05:49:15,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:15,858 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -245340416, now seen corresponding path program 1 times [2022-12-06 05:49:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:15,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872499655] [2022-12-06 05:49:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:15,908 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 05:49:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:15,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872499655] [2022-12-06 05:49:15,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872499655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:49:15,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:49:15,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:49:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550739280] [2022-12-06 05:49:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:49:15,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:49:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:49:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:49:15,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-06 05:49:15,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 412 transitions, 11169 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:49:15,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:15,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-06 05:49:15,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:16,989 INFO L130 PetriNetUnfolder]: 2110/3986 cut-off events. [2022-12-06 05:49:16,989 INFO L131 PetriNetUnfolder]: For 239462/239462 co-relation queries the response was YES. [2022-12-06 05:49:17,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51134 conditions, 3986 events. 2110/3986 cut-off events. For 239462/239462 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 28916 event pairs, 1050 based on Foata normal form. 6/3990 useless extension candidates. Maximal degree in co-relation 48654. Up to 3926 conditions per place. [2022-12-06 05:49:17,026 INFO L137 encePairwiseOnDemand]: 70/77 looper letters, 404 selfloop transitions, 16 changer transitions 0/420 dead transitions. [2022-12-06 05:49:17,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 420 transitions, 12219 flow [2022-12-06 05:49:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:49:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:49:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-06 05:49:17,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.354978354978355 [2022-12-06 05:49:17,027 INFO L175 Difference]: Start difference. First operand has 263 places, 412 transitions, 11169 flow. Second operand 3 states and 82 transitions. [2022-12-06 05:49:17,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 420 transitions, 12219 flow [2022-12-06 05:49:17,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 420 transitions, 11932 flow, removed 99 selfloop flow, removed 3 redundant places. [2022-12-06 05:49:17,792 INFO L231 Difference]: Finished difference. Result has 263 places, 414 transitions, 11010 flow [2022-12-06 05:49:17,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=10882, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=11010, PETRI_PLACES=263, PETRI_TRANSITIONS=414} [2022-12-06 05:49:17,793 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 242 predicate places. [2022-12-06 05:49:17,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:17,793 INFO L89 Accepts]: Start accepts. Operand has 263 places, 414 transitions, 11010 flow [2022-12-06 05:49:17,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:17,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:17,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 414 transitions, 11010 flow [2022-12-06 05:49:17,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 414 transitions, 11010 flow [2022-12-06 05:49:18,088 INFO L130 PetriNetUnfolder]: 516/1581 cut-off events. [2022-12-06 05:49:18,088 INFO L131 PetriNetUnfolder]: For 94071/94344 co-relation queries the response was YES. [2022-12-06 05:49:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19852 conditions, 1581 events. 516/1581 cut-off events. For 94071/94344 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 14169 event pairs, 101 based on Foata normal form. 11/1538 useless extension candidates. Maximal degree in co-relation 18848. Up to 579 conditions per place. [2022-12-06 05:49:18,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 414 transitions, 11010 flow [2022-12-06 05:49:18,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-06 05:49:18,141 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:18,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 348 [2022-12-06 05:49:18,141 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 414 transitions, 11010 flow [2022-12-06 05:49:18,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:49:18,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:18,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:18,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 05:49:18,142 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash -194623220, now seen corresponding path program 1 times [2022-12-06 05:49:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:18,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162922072] [2022-12-06 05:49:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:18,212 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 05:49:18,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:18,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162922072] [2022-12-06 05:49:18,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162922072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:18,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316157799] [2022-12-06 05:49:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:18,229 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:18,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 05:49:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:18,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:49:18,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:18,524 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 05:49:18,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:18,543 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 05:49:18,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316157799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:18,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:18,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 05:49:18,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109644418] [2022-12-06 05:49:18,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:18,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:49:18,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:18,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:49:18,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:49:18,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-06 05:49:18,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 414 transitions, 11010 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:49:18,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:18,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-06 05:49:18,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:20,062 INFO L130 PetriNetUnfolder]: 2158/4067 cut-off events. [2022-12-06 05:49:20,062 INFO L131 PetriNetUnfolder]: For 245300/245300 co-relation queries the response was YES. [2022-12-06 05:49:20,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51856 conditions, 4067 events. 2158/4067 cut-off events. For 245300/245300 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 29603 event pairs, 1010 based on Foata normal form. 56/4121 useless extension candidates. Maximal degree in co-relation 49363. Up to 3859 conditions per place. [2022-12-06 05:49:20,100 INFO L137 encePairwiseOnDemand]: 66/77 looper letters, 419 selfloop transitions, 38 changer transitions 0/457 dead transitions. [2022-12-06 05:49:20,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 457 transitions, 13017 flow [2022-12-06 05:49:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:49:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:49:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2022-12-06 05:49:20,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18668831168831168 [2022-12-06 05:49:20,107 INFO L175 Difference]: Start difference. First operand has 263 places, 414 transitions, 11010 flow. Second operand 8 states and 115 transitions. [2022-12-06 05:49:20,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 457 transitions, 13017 flow [2022-12-06 05:49:20,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 457 transitions, 12985 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 05:49:20,700 INFO L231 Difference]: Finished difference. Result has 273 places, 424 transitions, 11557 flow [2022-12-06 05:49:20,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=10978, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11557, PETRI_PLACES=273, PETRI_TRANSITIONS=424} [2022-12-06 05:49:20,702 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 252 predicate places. [2022-12-06 05:49:20,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:20,702 INFO L89 Accepts]: Start accepts. Operand has 273 places, 424 transitions, 11557 flow [2022-12-06 05:49:20,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:20,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:20,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 424 transitions, 11557 flow [2022-12-06 05:49:20,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 424 transitions, 11557 flow [2022-12-06 05:49:21,037 INFO L130 PetriNetUnfolder]: 529/1613 cut-off events. [2022-12-06 05:49:21,038 INFO L131 PetriNetUnfolder]: For 107715/108000 co-relation queries the response was YES. [2022-12-06 05:49:21,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21147 conditions, 1613 events. 529/1613 cut-off events. For 107715/108000 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 14500 event pairs, 98 based on Foata normal form. 11/1569 useless extension candidates. Maximal degree in co-relation 20102. Up to 589 conditions per place. [2022-12-06 05:49:21,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 424 transitions, 11557 flow [2022-12-06 05:49:21,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 1258 [2022-12-06 05:49:22,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:22,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1329 [2022-12-06 05:49:22,031 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 424 transitions, 11572 flow [2022-12-06 05:49:22,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:49:22,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:22,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:22,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:22,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-06 05:49:22,232 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1192937028, now seen corresponding path program 1 times [2022-12-06 05:49:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:22,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828337755] [2022-12-06 05:49:22,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:22,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:23,120 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 05:49:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:23,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828337755] [2022-12-06 05:49:23,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828337755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:23,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238980367] [2022-12-06 05:49:23,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:23,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:23,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:23,122 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:23,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 05:49:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:23,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:49:23,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:23,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:49:23,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-06 05:49:23,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:23,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 05:49:23,380 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 05:49:23,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:23,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:23,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-06 05:49:23,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:23,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-06 05:49:28,581 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 05:49:28,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238980367] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:28,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:28,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:49:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043512208] [2022-12-06 05:49:28,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:28,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:49:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:28,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:49:28,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:49:28,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 05:49:28,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 424 transitions, 11572 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:28,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:28,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 05:49:28,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:31,368 INFO L130 PetriNetUnfolder]: 2340/4388 cut-off events. [2022-12-06 05:49:31,368 INFO L131 PetriNetUnfolder]: For 299343/299343 co-relation queries the response was YES. [2022-12-06 05:49:31,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59228 conditions, 4388 events. 2340/4388 cut-off events. For 299343/299343 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 32115 event pairs, 407 based on Foata normal form. 3/4389 useless extension candidates. Maximal degree in co-relation 56639. Up to 3186 conditions per place. [2022-12-06 05:49:31,413 INFO L137 encePairwiseOnDemand]: 19/78 looper letters, 327 selfloop transitions, 199 changer transitions 23/549 dead transitions. [2022-12-06 05:49:31,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 549 transitions, 15401 flow [2022-12-06 05:49:31,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:49:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:49:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 189 transitions. [2022-12-06 05:49:31,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16153846153846155 [2022-12-06 05:49:31,414 INFO L175 Difference]: Start difference. First operand has 273 places, 424 transitions, 11572 flow. Second operand 15 states and 189 transitions. [2022-12-06 05:49:31,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 549 transitions, 15401 flow [2022-12-06 05:49:32,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 549 transitions, 15012 flow, removed 193 selfloop flow, removed 1 redundant places. [2022-12-06 05:49:32,191 INFO L231 Difference]: Finished difference. Result has 291 places, 466 transitions, 13277 flow [2022-12-06 05:49:32,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=11221, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13277, PETRI_PLACES=291, PETRI_TRANSITIONS=466} [2022-12-06 05:49:32,191 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 270 predicate places. [2022-12-06 05:49:32,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:32,192 INFO L89 Accepts]: Start accepts. Operand has 291 places, 466 transitions, 13277 flow [2022-12-06 05:49:32,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:32,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:32,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 466 transitions, 13277 flow [2022-12-06 05:49:32,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 466 transitions, 13277 flow [2022-12-06 05:49:32,542 INFO L130 PetriNetUnfolder]: 574/1730 cut-off events. [2022-12-06 05:49:32,543 INFO L131 PetriNetUnfolder]: For 122721/123012 co-relation queries the response was YES. [2022-12-06 05:49:32,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23589 conditions, 1730 events. 574/1730 cut-off events. For 122721/123012 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 15706 event pairs, 107 based on Foata normal form. 12/1687 useless extension candidates. Maximal degree in co-relation 23149. Up to 640 conditions per place. [2022-12-06 05:49:32,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 466 transitions, 13277 flow [2022-12-06 05:49:32,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 1382 [2022-12-06 05:49:32,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 05:49:32,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [785] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_436| v_~f~0.base_328))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_328 (* v_~x2~0_448 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_586| 4294967296) (* (mod v_~n~0_335 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_248| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_424| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_248| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_336)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_408| (ite (and (< v_~x1~0_709 v_~size~0_336) (<= 0 v_~x1~0_709)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_328 (* .cse0 4))) v_~x2~0_447) (= (select .cse1 (+ v_~f~0.offset_328 (* v_~x1~0_709 4))) v_~x1~0_708) (= |v_thread1Thread1of1ForFork0_~i~0#1_585| (+ |v_thread1Thread1of1ForFork0_~i~0#1_586| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_408| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_424|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_363|) (not (= (ite (and (< v_~x2~0_448 v_~size~0_336) (<= 0 v_~x2~0_448)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_448, ~size~0=v_~size~0_336, ~f~0.base=v_~f~0.base_328, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_586|, #memory_int=|v_#memory_int_436|, ~n~0=v_~n~0_335, ~x1~0=v_~x1~0_709, ~f~0.offset=v_~f~0.offset_328} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_426|, ~x2~0=v_~x2~0_447, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_234|, ~size~0=v_~size~0_336, ~f~0.base=v_~f~0.base_328, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_238|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_248|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_363|, ~x1~0=v_~x1~0_708, ~f~0.offset=v_~f~0.offset_328, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_408|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_585|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_424|, #memory_int=|v_#memory_int_436|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_224|, ~n~0=v_~n~0_335, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_434|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_224|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:49:33,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [663] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_266| v_~f~0.base_176))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_176 (* v_~x1~0_313 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_176 (* v_~x2~0_237 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (= (ite (and (< v_~x2~0_237 v_~size~0_184) (<= 0 v_~x2~0_237)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_313) (< v_~x1~0_313 v_~size~0_184)) 1 0))) (= v_~x1~0_312 (select .cse0 (+ v_~f~0.offset_176 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_236| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_236| 4294967295) 4294967296) (* (mod v_~n~0_183 2147483648) 2)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_176|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (< .cse2 v_~size~0_184) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| (ite (and (< .cse1 v_~size~0_184) (<= 0 .cse1)) 1 0)) (= v_~x2~0_236 (select .cse0 (+ v_~f~0.offset_176 (* .cse2 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, #memory_int=|v_#memory_int_266|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_313, ~f~0.offset=v_~f~0.offset_176} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_178|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_119|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_176|, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_176, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_236|, #memory_int=|v_#memory_int_266|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_105|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_105|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_186|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [667] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_274| v_~f~0.base_184))) (let ((.cse0 (* 2 (mod v_~n~0_191 2147483648))) (.cse1 (select .cse2 (+ v_~f~0.offset_184 (* v_~x2~0_253 4))))) (and (= (ite (and (< v_~x1~0_329 v_~size~0_192) (<= 0 v_~x1~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_251| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_253 v_~size~0_192) (<= 0 v_~x2~0_253)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_191|) |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= |v_thread1Thread1of1ForFork0_~i~0#1_250| (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_191| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_184 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= v_~x1~0_328 (select .cse2 (+ v_~f~0.offset_184 (* v_~x1~0_329 4))))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, #memory_int=|v_#memory_int_274|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_190|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_250|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_113|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_113|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:49:33,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [663] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_266| v_~f~0.base_176))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_176 (* v_~x1~0_313 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_176 (* v_~x2~0_237 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (= (ite (and (< v_~x2~0_237 v_~size~0_184) (<= 0 v_~x2~0_237)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_313) (< v_~x1~0_313 v_~size~0_184)) 1 0))) (= v_~x1~0_312 (select .cse0 (+ v_~f~0.offset_176 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_236| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_236| 4294967295) 4294967296) (* (mod v_~n~0_183 2147483648) 2)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_176|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (< .cse2 v_~size~0_184) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| (ite (and (< .cse1 v_~size~0_184) (<= 0 .cse1)) 1 0)) (= v_~x2~0_236 (select .cse0 (+ v_~f~0.offset_176 (* .cse2 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, #memory_int=|v_#memory_int_266|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_313, ~f~0.offset=v_~f~0.offset_176} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_178|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_119|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_176|, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_176, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_236|, #memory_int=|v_#memory_int_266|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_105|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_105|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_186|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [668] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_276| v_~f~0.base_186))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_186 (* v_~x1~0_335 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_186 (* v_~x2~0_258 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_186 (* .cse2 4)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_256| 4294967295) 4294967296) .cse0) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_196|) |v_thread2Thread1of1ForFork1_~i~1#1_195|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_194)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_335 v_~size~0_194) (<= 0 v_~x1~0_335)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_256| (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= v_~x1~0_334 (select .cse3 (+ v_~f~0.offset_186 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188| 0)) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_194)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_186 (* .cse1 4))) v_~x2~0_257) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_196| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, #memory_int=|v_#memory_int_276|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_196|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_335, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_257, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_190|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_126|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_195|, ~x1~0=v_~x1~0_334, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_256|, #memory_int=|v_#memory_int_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_116|, ~n~0=v_~n~0_193, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_116|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:49:34,650 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:49:34,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2459 [2022-12-06 05:49:34,650 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 465 transitions, 13418 flow [2022-12-06 05:49:34,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:34,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:34,651 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:34,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:34,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:34,851 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash 577030269, now seen corresponding path program 1 times [2022-12-06 05:49:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:34,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514214941] [2022-12-06 05:49:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:35,724 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 05:49:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514214941] [2022-12-06 05:49:35,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514214941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884064004] [2022-12-06 05:49:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:35,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:35,728 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:35,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 05:49:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:35,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 05:49:35,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:35,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:49:35,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:49:35,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:35,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 05:49:35,944 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 05:49:35,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:36,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:36,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 376 [2022-12-06 05:49:36,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:36,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 196 [2022-12-06 05:49:39,075 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 05:49:39,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884064004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:39,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:39,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:49:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443795365] [2022-12-06 05:49:39,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:39,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:49:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:49:39,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:49:39,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-06 05:49:39,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 465 transitions, 13418 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:39,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:39,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-06 05:49:39,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:42,209 INFO L130 PetriNetUnfolder]: 2366/4436 cut-off events. [2022-12-06 05:49:42,210 INFO L131 PetriNetUnfolder]: For 325544/325544 co-relation queries the response was YES. [2022-12-06 05:49:42,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60869 conditions, 4436 events. 2366/4436 cut-off events. For 325544/325544 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 32741 event pairs, 835 based on Foata normal form. 1/4435 useless extension candidates. Maximal degree in co-relation 59873. Up to 3984 conditions per place. [2022-12-06 05:49:42,255 INFO L137 encePairwiseOnDemand]: 16/85 looper letters, 346 selfloop transitions, 174 changer transitions 7/527 dead transitions. [2022-12-06 05:49:42,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 527 transitions, 15629 flow [2022-12-06 05:49:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:49:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:49:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2022-12-06 05:49:42,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14027149321266968 [2022-12-06 05:49:42,257 INFO L175 Difference]: Start difference. First operand has 290 places, 465 transitions, 13418 flow. Second operand 13 states and 155 transitions. [2022-12-06 05:49:42,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 527 transitions, 15629 flow [2022-12-06 05:49:43,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 527 transitions, 15160 flow, removed 210 selfloop flow, removed 3 redundant places. [2022-12-06 05:49:43,099 INFO L231 Difference]: Finished difference. Result has 303 places, 478 transitions, 13915 flow [2022-12-06 05:49:43,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=12973, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=13915, PETRI_PLACES=303, PETRI_TRANSITIONS=478} [2022-12-06 05:49:43,100 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 282 predicate places. [2022-12-06 05:49:43,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:43,100 INFO L89 Accepts]: Start accepts. Operand has 303 places, 478 transitions, 13915 flow [2022-12-06 05:49:43,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:43,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:43,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 303 places, 478 transitions, 13915 flow [2022-12-06 05:49:43,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 478 transitions, 13915 flow [2022-12-06 05:49:43,476 INFO L130 PetriNetUnfolder]: 585/1763 cut-off events. [2022-12-06 05:49:43,476 INFO L131 PetriNetUnfolder]: For 126179/126466 co-relation queries the response was YES. [2022-12-06 05:49:43,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24175 conditions, 1763 events. 585/1763 cut-off events. For 126179/126466 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 16072 event pairs, 111 based on Foata normal form. 8/1718 useless extension candidates. Maximal degree in co-relation 23845. Up to 653 conditions per place. [2022-12-06 05:49:43,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 478 transitions, 13915 flow [2022-12-06 05:49:43,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 1414 [2022-12-06 05:49:43,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] $Ultimate##0-->L83-3: Formula: (let ((.cse2 (select |v_#memory_int_500| v_~f~0.base_378))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_378 (* v_~x1~0_844 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_378 (* .cse1 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_686| 3) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_386)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_491|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_386)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507| 0)) (= (store |v_#memory_int_500| |v_ULTIMATE.start_main_~#t2~0#1.base_69| (store (select |v_#memory_int_500| |v_ULTIMATE.start_main_~#t2~0#1.base_69|) |v_ULTIMATE.start_main_~#t2~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre12#1_102|)) |v_#memory_int_499|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_491| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|) (= (select .cse2 (+ v_~f~0.offset_378 (* 4 .cse0))) v_~x1~0_843) (not (= (ite (and (<= 0 v_~x1~0_844) (< v_~x1~0_844 v_~size~0_386)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_686| 4294967295) 4294967296) (* (mod v_~n~0_385 2147483648) 2)) (= |v_ULTIMATE.start_main_#t~pre12#1_102| |v_#pthreadsForks_116|) (= |v_#pthreadsForks_115| (+ |v_#pthreadsForks_116| 1)))))) InVars {#pthreadsForks=|v_#pthreadsForks_116|, ~size~0=v_~size~0_386, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ~f~0.base=v_~f~0.base_378, #memory_int=|v_#memory_int_500|, ~n~0=v_~n~0_385, ~x1~0=v_~x1~0_844, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_69|, ~f~0.offset=v_~f~0.offset_378} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_509|, ~size~0=v_~size~0_386, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ~f~0.base=v_~f~0.base_378, ~x1~0=v_~x1~0_843, ~f~0.offset=v_~f~0.offset_378, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_491|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_77|, #pthreadsForks=|v_#pthreadsForks_115|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_686|, #memory_int=|v_#memory_int_499|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|, ~n~0=v_~n~0_385, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_517|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_69|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:49:43,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:43,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 634 [2022-12-06 05:49:43,734 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 478 transitions, 13945 flow [2022-12-06 05:49:43,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:43,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:43,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:43,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 05:49:43,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:43,935 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1283446721, now seen corresponding path program 1 times [2022-12-06 05:49:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734502700] [2022-12-06 05:49:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:43,995 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 05:49:43,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:43,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734502700] [2022-12-06 05:49:43,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734502700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:49:43,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:49:43,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:49:43,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648823919] [2022-12-06 05:49:43,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:49:43,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:49:43,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:43,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:49:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:49:43,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 86 [2022-12-06 05:49:43,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 478 transitions, 13945 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:49:43,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:43,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 86 [2022-12-06 05:49:43,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:45,422 INFO L130 PetriNetUnfolder]: 2397/4489 cut-off events. [2022-12-06 05:49:45,422 INFO L131 PetriNetUnfolder]: For 318801/318801 co-relation queries the response was YES. [2022-12-06 05:49:45,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61937 conditions, 4489 events. 2397/4489 cut-off events. For 318801/318801 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 33038 event pairs, 1066 based on Foata normal form. 14/4501 useless extension candidates. Maximal degree in co-relation 60504. Up to 4128 conditions per place. [2022-12-06 05:49:45,468 INFO L137 encePairwiseOnDemand]: 36/86 looper letters, 380 selfloop transitions, 119 changer transitions 1/500 dead transitions. [2022-12-06 05:49:45,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 500 transitions, 15560 flow [2022-12-06 05:49:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:49:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:49:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-06 05:49:45,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36046511627906974 [2022-12-06 05:49:45,469 INFO L175 Difference]: Start difference. First operand has 303 places, 478 transitions, 13945 flow. Second operand 3 states and 93 transitions. [2022-12-06 05:49:45,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 500 transitions, 15560 flow [2022-12-06 05:49:46,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 500 transitions, 15243 flow, removed 64 selfloop flow, removed 6 redundant places. [2022-12-06 05:49:46,322 INFO L231 Difference]: Finished difference. Result has 300 places, 486 transitions, 14263 flow [2022-12-06 05:49:46,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=13628, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=14263, PETRI_PLACES=300, PETRI_TRANSITIONS=486} [2022-12-06 05:49:46,322 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 279 predicate places. [2022-12-06 05:49:46,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:46,322 INFO L89 Accepts]: Start accepts. Operand has 300 places, 486 transitions, 14263 flow [2022-12-06 05:49:46,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:46,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:46,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 300 places, 486 transitions, 14263 flow [2022-12-06 05:49:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 486 transitions, 14263 flow [2022-12-06 05:49:46,656 INFO L130 PetriNetUnfolder]: 596/1791 cut-off events. [2022-12-06 05:49:46,657 INFO L131 PetriNetUnfolder]: For 133061/133340 co-relation queries the response was YES. [2022-12-06 05:49:46,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24888 conditions, 1791 events. 596/1791 cut-off events. For 133061/133340 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 16344 event pairs, 108 based on Foata normal form. 9/1747 useless extension candidates. Maximal degree in co-relation 24657. Up to 667 conditions per place. [2022-12-06 05:49:46,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 486 transitions, 14263 flow [2022-12-06 05:49:46,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 1420 [2022-12-06 05:49:46,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [816] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_486| v_~f~0.base_368))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_368 (* v_~x1~0_806 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_368 (* .cse11 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_368 (* 4 .cse6))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_368 (* 4 .cse8)))) (.cse2 (select .cse4 (+ v_~f~0.offset_368 (* v_~x2~0_525 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_368 (* .cse2 4)))) (.cse1 (select .cse4 (+ v_~f~0.offset_368 (* .cse0 4))))) (let ((.cse13 (select .cse4 (+ v_~f~0.offset_368 (* .cse1 4)))) (.cse5 (select .cse4 (+ (* .cse9 4) v_~f~0.offset_368)))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_368 (* .cse5 4)))) (.cse7 (select .cse4 (+ v_~f~0.offset_368 (* .cse13 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_368 (* .cse7 4)))) (.cse12 (select .cse4 (+ v_~f~0.offset_368 (* .cse10 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_320|) (not (= (ite (and (< .cse0 v_~size~0_376) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_376) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_376) (<= 0 .cse2)) 1 0) 0)) (= (ite (and (< .cse3 v_~size~0_376) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_465|) (= v_~x1~0_804 (select .cse4 (+ v_~f~0.offset_368 (* .cse3 4)))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_376)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_656| 9) (not (= (ite (and (< .cse6 v_~size~0_376) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_376)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_421|) (not (= (ite (and (< .cse8 v_~size~0_376) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_376)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_806) (< v_~x1~0_806 v_~size~0_376)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_376)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_481| 0)) (not (= (ite (and (<= 0 v_~x2~0_525) (< v_~x2~0_525 v_~size~0_376)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_376) (<= 0 .cse11)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_656| 4294967295) 4294967296) (* (mod v_~n~0_375 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_465| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_481|) (= v_~x2~0_524 (select .cse4 (+ v_~f~0.offset_368 (* .cse12 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296| (ite (and (< .cse12 v_~size~0_376) (<= 0 .cse12)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_320| 0)) (not (= (ite (and (< .cse13 v_~size~0_376) (<= 0 .cse13)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_525, ~size~0=v_~size~0_376, ~f~0.base=v_~f~0.base_368, #memory_int=|v_#memory_int_486|, ~n~0=v_~n~0_375, ~x1~0=v_~x1~0_806, ~f~0.offset=v_~f~0.offset_368} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_483|, ~x2~0=v_~x2~0_524, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_282|, ~size~0=v_~size~0_376, ~f~0.base=v_~f~0.base_368, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_421|, ~x1~0=v_~x1~0_804, ~f~0.offset=v_~f~0.offset_368, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_320|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_465|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_656|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_481|, #memory_int=|v_#memory_int_486|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_272|, ~n~0=v_~n~0_375, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_491|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_272|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:49:47,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:47,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1556 [2022-12-06 05:49:47,878 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 485 transitions, 14253 flow [2022-12-06 05:49:47,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:49:47,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:47,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:47,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 05:49:47,878 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1877457148, now seen corresponding path program 1 times [2022-12-06 05:49:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:47,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077013388] [2022-12-06 05:49:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:49,556 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 05:49:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:49,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077013388] [2022-12-06 05:49:49,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077013388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:49,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749836940] [2022-12-06 05:49:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:49,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:49,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:49,559 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:49,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 05:49:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:49,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:49:49,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:49,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:49:49,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-12-06 05:49:49,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:49,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 05:49:49,814 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 05:49:49,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:50,007 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:50,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-06 05:49:50,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:50,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-06 05:49:52,404 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 05:49:52,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749836940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:52,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:52,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:49:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972739532] [2022-12-06 05:49:52,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:52,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:49:52,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:52,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:49:52,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:49:52,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 86 [2022-12-06 05:49:52,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 485 transitions, 14253 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:52,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:52,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 86 [2022-12-06 05:49:52,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:56,850 INFO L130 PetriNetUnfolder]: 2559/4786 cut-off events. [2022-12-06 05:49:56,850 INFO L131 PetriNetUnfolder]: For 354669/354669 co-relation queries the response was YES. [2022-12-06 05:49:56,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67036 conditions, 4786 events. 2559/4786 cut-off events. For 354669/354669 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 35472 event pairs, 550 based on Foata normal form. 1/4785 useless extension candidates. Maximal degree in co-relation 65916. Up to 4131 conditions per place. [2022-12-06 05:49:56,935 INFO L137 encePairwiseOnDemand]: 19/86 looper letters, 400 selfloop transitions, 163 changer transitions 25/588 dead transitions. [2022-12-06 05:49:56,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 588 transitions, 17939 flow [2022-12-06 05:49:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:49:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:49:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 167 transitions. [2022-12-06 05:49:56,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1618217054263566 [2022-12-06 05:49:56,937 INFO L175 Difference]: Start difference. First operand has 299 places, 485 transitions, 14253 flow. Second operand 12 states and 167 transitions. [2022-12-06 05:49:56,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 588 transitions, 17939 flow [2022-12-06 05:49:58,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 588 transitions, 17779 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 05:49:58,503 INFO L231 Difference]: Finished difference. Result has 313 places, 522 transitions, 16011 flow [2022-12-06 05:49:58,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=14104, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16011, PETRI_PLACES=313, PETRI_TRANSITIONS=522} [2022-12-06 05:49:58,505 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 292 predicate places. [2022-12-06 05:49:58,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:58,505 INFO L89 Accepts]: Start accepts. Operand has 313 places, 522 transitions, 16011 flow [2022-12-06 05:49:58,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:58,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:58,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 522 transitions, 16011 flow [2022-12-06 05:49:58,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 522 transitions, 16011 flow [2022-12-06 05:49:58,933 INFO L130 PetriNetUnfolder]: 637/1899 cut-off events. [2022-12-06 05:49:58,933 INFO L131 PetriNetUnfolder]: For 146159/146434 co-relation queries the response was YES. [2022-12-06 05:49:58,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27059 conditions, 1899 events. 637/1899 cut-off events. For 146159/146434 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 17446 event pairs, 121 based on Foata normal form. 8/1853 useless extension candidates. Maximal degree in co-relation 26510. Up to 730 conditions per place. [2022-12-06 05:49:58,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 522 transitions, 16011 flow [2022-12-06 05:49:58,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 1526 [2022-12-06 05:49:58,971 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:58,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 467 [2022-12-06 05:49:58,972 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 522 transitions, 16011 flow [2022-12-06 05:49:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:49:58,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:58,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:58,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-06 05:49:59,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:59,181 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -767680065, now seen corresponding path program 1 times [2022-12-06 05:49:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:59,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640741371] [2022-12-06 05:49:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:59,235 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 05:49:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:59,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640741371] [2022-12-06 05:49:59,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640741371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:49:59,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:49:59,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:49:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209079370] [2022-12-06 05:49:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:49:59,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:49:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:49:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:49:59,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 86 [2022-12-06 05:49:59,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 522 transitions, 16011 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:49:59,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:59,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 86 [2022-12-06 05:49:59,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:00,949 INFO L130 PetriNetUnfolder]: 2566/4797 cut-off events. [2022-12-06 05:50:00,949 INFO L131 PetriNetUnfolder]: For 357351/357351 co-relation queries the response was YES. [2022-12-06 05:50:00,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67970 conditions, 4797 events. 2566/4797 cut-off events. For 357351/357351 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 35584 event pairs, 1259 based on Foata normal form. 8/4803 useless extension candidates. Maximal degree in co-relation 66837. Up to 4753 conditions per place. [2022-12-06 05:50:00,999 INFO L137 encePairwiseOnDemand]: 79/86 looper letters, 518 selfloop transitions, 15 changer transitions 0/533 dead transitions. [2022-12-06 05:50:01,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 533 transitions, 17281 flow [2022-12-06 05:50:01,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:50:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:50:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-06 05:50:01,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2819767441860465 [2022-12-06 05:50:01,001 INFO L175 Difference]: Start difference. First operand has 313 places, 522 transitions, 16011 flow. Second operand 4 states and 97 transitions. [2022-12-06 05:50:01,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 533 transitions, 17281 flow [2022-12-06 05:50:02,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 533 transitions, 16913 flow, removed 183 selfloop flow, removed 1 redundant places. [2022-12-06 05:50:02,206 INFO L231 Difference]: Finished difference. Result has 317 places, 526 transitions, 15792 flow [2022-12-06 05:50:02,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=15643, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15792, PETRI_PLACES=317, PETRI_TRANSITIONS=526} [2022-12-06 05:50:02,206 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 296 predicate places. [2022-12-06 05:50:02,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:02,206 INFO L89 Accepts]: Start accepts. Operand has 317 places, 526 transitions, 15792 flow [2022-12-06 05:50:02,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:02,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:02,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 526 transitions, 15792 flow [2022-12-06 05:50:02,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 317 places, 526 transitions, 15792 flow [2022-12-06 05:50:02,577 INFO L130 PetriNetUnfolder]: 640/1903 cut-off events. [2022-12-06 05:50:02,577 INFO L131 PetriNetUnfolder]: For 147871/148153 co-relation queries the response was YES. [2022-12-06 05:50:02,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27003 conditions, 1903 events. 640/1903 cut-off events. For 147871/148153 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 17449 event pairs, 120 based on Foata normal form. 3/1851 useless extension candidates. Maximal degree in co-relation 26597. Up to 732 conditions per place. [2022-12-06 05:50:02,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 526 transitions, 15792 flow [2022-12-06 05:50:02,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 1538 [2022-12-06 05:50:02,612 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:50:02,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 406 [2022-12-06 05:50:02,612 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 526 transitions, 15792 flow [2022-12-06 05:50:02,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:50:02,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:02,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:02,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 05:50:02,613 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1417160630, now seen corresponding path program 1 times [2022-12-06 05:50:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:02,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034666786] [2022-12-06 05:50:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:07,229 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 05:50:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:07,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034666786] [2022-12-06 05:50:07,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034666786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:07,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537319520] [2022-12-06 05:50:07,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:07,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:07,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:07,231 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:50:07,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 05:50:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:07,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 05:50:07,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:07,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:07,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-06 05:50:07,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:07,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 05:50:07,460 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 05:50:07,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:07,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:07,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-06 05:50:07,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:07,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-06 05:50:10,028 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 05:50:10,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537319520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:10,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:10,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:50:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324612379] [2022-12-06 05:50:10,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:10,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:50:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:50:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:50:10,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 86 [2022-12-06 05:50:10,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 526 transitions, 15792 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:50:10,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:10,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 86 [2022-12-06 05:50:10,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:12,860 INFO L130 PetriNetUnfolder]: 2646/4943 cut-off events. [2022-12-06 05:50:12,860 INFO L131 PetriNetUnfolder]: For 390967/390967 co-relation queries the response was YES. [2022-12-06 05:50:12,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70396 conditions, 4943 events. 2646/4943 cut-off events. For 390967/390967 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 36931 event pairs, 1094 based on Foata normal form. 1/4942 useless extension candidates. Maximal degree in co-relation 69047. Up to 4381 conditions per place. [2022-12-06 05:50:12,920 INFO L137 encePairwiseOnDemand]: 24/86 looper letters, 450 selfloop transitions, 134 changer transitions 19/603 dead transitions. [2022-12-06 05:50:12,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 603 transitions, 18589 flow [2022-12-06 05:50:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:50:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:50:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 171 transitions. [2022-12-06 05:50:12,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15295169946332737 [2022-12-06 05:50:12,921 INFO L175 Difference]: Start difference. First operand has 317 places, 526 transitions, 15792 flow. Second operand 13 states and 171 transitions. [2022-12-06 05:50:12,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 603 transitions, 18589 flow [2022-12-06 05:50:14,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 603 transitions, 18551 flow, removed 19 selfloop flow, removed 0 redundant places. [2022-12-06 05:50:14,179 INFO L231 Difference]: Finished difference. Result has 331 places, 539 transitions, 16741 flow [2022-12-06 05:50:14,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=15754, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=16741, PETRI_PLACES=331, PETRI_TRANSITIONS=539} [2022-12-06 05:50:14,179 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 310 predicate places. [2022-12-06 05:50:14,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:14,179 INFO L89 Accepts]: Start accepts. Operand has 331 places, 539 transitions, 16741 flow [2022-12-06 05:50:14,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:14,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:14,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 539 transitions, 16741 flow [2022-12-06 05:50:14,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 539 transitions, 16741 flow [2022-12-06 05:50:14,618 INFO L130 PetriNetUnfolder]: 660/1955 cut-off events. [2022-12-06 05:50:14,618 INFO L131 PetriNetUnfolder]: For 159338/159651 co-relation queries the response was YES. [2022-12-06 05:50:14,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28336 conditions, 1955 events. 660/1955 cut-off events. For 159338/159651 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 17985 event pairs, 126 based on Foata normal form. 4/1900 useless extension candidates. Maximal degree in co-relation 27690. Up to 758 conditions per place. [2022-12-06 05:50:14,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 539 transitions, 16741 flow [2022-12-06 05:50:14,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-06 05:50:14,653 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:50:14,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 05:50:14,654 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 539 transitions, 16741 flow [2022-12-06 05:50:14,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 05:50:14,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:14,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:14,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 05:50:14,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:14,856 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1925077899, now seen corresponding path program 1 times [2022-12-06 05:50:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:14,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399568164] [2022-12-06 05:50:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:14,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:14,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:14,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399568164] [2022-12-06 05:50:14,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399568164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:14,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773216059] [2022-12-06 05:50:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:14,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:14,931 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:50:14,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 05:50:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:15,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:50:15,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:15,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:15,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773216059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:15,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:15,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 05:50:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965134611] [2022-12-06 05:50:15,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:15,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:50:15,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:15,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:50:15,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:50:15,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 86 [2022-12-06 05:50:15,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 539 transitions, 16741 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 05:50:15,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:15,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 86 [2022-12-06 05:50:15,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:17,714 INFO L130 PetriNetUnfolder]: 2943/5477 cut-off events. [2022-12-06 05:50:17,714 INFO L131 PetriNetUnfolder]: For 455079/455079 co-relation queries the response was YES. [2022-12-06 05:50:17,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80613 conditions, 5477 events. 2943/5477 cut-off events. For 455079/455079 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 41164 event pairs, 971 based on Foata normal form. 20/5495 useless extension candidates. Maximal degree in co-relation 78458. Up to 2565 conditions per place. [2022-12-06 05:50:17,814 INFO L137 encePairwiseOnDemand]: 46/86 looper letters, 580 selfloop transitions, 93 changer transitions 0/673 dead transitions. [2022-12-06 05:50:17,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 673 transitions, 21886 flow [2022-12-06 05:50:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:50:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:50:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 170 transitions. [2022-12-06 05:50:17,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14119601328903655 [2022-12-06 05:50:17,820 INFO L175 Difference]: Start difference. First operand has 331 places, 539 transitions, 16741 flow. Second operand 14 states and 170 transitions. [2022-12-06 05:50:17,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 673 transitions, 21886 flow [2022-12-06 05:50:19,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 673 transitions, 21511 flow, removed 123 selfloop flow, removed 7 redundant places. [2022-12-06 05:50:19,334 INFO L231 Difference]: Finished difference. Result has 343 places, 549 transitions, 17093 flow [2022-12-06 05:50:19,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=16370, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=17093, PETRI_PLACES=343, PETRI_TRANSITIONS=549} [2022-12-06 05:50:19,334 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 322 predicate places. [2022-12-06 05:50:19,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:19,334 INFO L89 Accepts]: Start accepts. Operand has 343 places, 549 transitions, 17093 flow [2022-12-06 05:50:19,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:19,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:19,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 549 transitions, 17093 flow [2022-12-06 05:50:19,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 343 places, 549 transitions, 17093 flow [2022-12-06 05:50:19,817 INFO L130 PetriNetUnfolder]: 739/2160 cut-off events. [2022-12-06 05:50:19,817 INFO L131 PetriNetUnfolder]: For 199397/199764 co-relation queries the response was YES. [2022-12-06 05:50:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32841 conditions, 2160 events. 739/2160 cut-off events. For 199397/199764 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 20169 event pairs, 149 based on Foata normal form. 3/2102 useless extension candidates. Maximal degree in co-relation 31962. Up to 865 conditions per place. [2022-12-06 05:50:19,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 549 transitions, 17093 flow [2022-12-06 05:50:19,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 1642 [2022-12-06 05:50:19,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [818] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_488| v_~f~0.base_370))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_370 (* v_~x1~0_812 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_370 (* .cse3 4)))) (.cse2 (* 2 (mod v_~n~0_377 2147483648)))) (and (= (select .cse0 (+ v_~f~0.offset_370 (* .cse1 4))) v_~x1~0_810) (= |v_thread1Thread1of1ForFork0_~i~0#1_660| (+ |v_thread1Thread1of1ForFork0_~i~0#1_662| 3)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_378)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_469|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_662| 2) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_469| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_662| 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485| 0)) (not (= (ite (and (<= 0 v_~x1~0_812) (< v_~x1~0_812 v_~size~0_378)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_378)) 1 0) 0)))))) InVars {~size~0=v_~size~0_378, ~f~0.base=v_~f~0.base_370, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_662|, #memory_int=|v_#memory_int_488|, ~n~0=v_~n~0_377, ~x1~0=v_~x1~0_812, ~f~0.offset=v_~f~0.offset_370} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_487|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_469|, ~size~0=v_~size~0_378, ~f~0.base=v_~f~0.base_370, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_660|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, #memory_int=|v_#memory_int_488|, ~n~0=v_~n~0_377, ~x1~0=v_~x1~0_810, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_495|, ~f~0.offset=v_~f~0.offset_370} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:20,898 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:50:20,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1565 [2022-12-06 05:50:20,899 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 549 transitions, 17152 flow [2022-12-06 05:50:20,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 05:50:20,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:20,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:20,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 05:50:21,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-06 05:50:21,105 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash 225933573, now seen corresponding path program 1 times [2022-12-06 05:50:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:21,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507538808] [2022-12-06 05:50:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:21,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507538808] [2022-12-06 05:50:21,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507538808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:21,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249333652] [2022-12-06 05:50:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:21,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:21,191 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:50:21,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 05:50:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:21,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:50:21,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:21,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:21,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249333652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:21,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:21,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 05:50:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953361394] [2022-12-06 05:50:21,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:21,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:50:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:21,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:50:21,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:50:21,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 87 [2022-12-06 05:50:21,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 549 transitions, 17152 flow. Second operand has 11 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 05:50:21,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:21,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 87 [2022-12-06 05:50:21,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:25,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:50:27,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:50:30,891 INFO L130 PetriNetUnfolder]: 3563/6865 cut-off events. [2022-12-06 05:50:30,891 INFO L131 PetriNetUnfolder]: For 701680/701680 co-relation queries the response was YES. [2022-12-06 05:50:30,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104528 conditions, 6865 events. 3563/6865 cut-off events. For 701680/701680 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 55605 event pairs, 628 based on Foata normal form. 84/6947 useless extension candidates. Maximal degree in co-relation 101871. Up to 2465 conditions per place. [2022-12-06 05:50:30,973 INFO L137 encePairwiseOnDemand]: 37/87 looper letters, 540 selfloop transitions, 290 changer transitions 29/859 dead transitions. [2022-12-06 05:50:30,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 859 transitions, 28012 flow [2022-12-06 05:50:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 05:50:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 05:50:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 247 transitions. [2022-12-06 05:50:30,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10515112813963388 [2022-12-06 05:50:30,975 INFO L175 Difference]: Start difference. First operand has 343 places, 549 transitions, 17152 flow. Second operand 27 states and 247 transitions. [2022-12-06 05:50:30,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 859 transitions, 28012 flow [2022-12-06 05:50:32,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 859 transitions, 27421 flow, removed 266 selfloop flow, removed 4 redundant places. [2022-12-06 05:50:32,871 INFO L231 Difference]: Finished difference. Result has 381 places, 680 transitions, 22821 flow [2022-12-06 05:50:32,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=16823, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=22821, PETRI_PLACES=381, PETRI_TRANSITIONS=680} [2022-12-06 05:50:32,871 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 360 predicate places. [2022-12-06 05:50:32,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:32,872 INFO L89 Accepts]: Start accepts. Operand has 381 places, 680 transitions, 22821 flow [2022-12-06 05:50:32,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:32,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:32,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 381 places, 680 transitions, 22821 flow [2022-12-06 05:50:32,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 381 places, 680 transitions, 22821 flow [2022-12-06 05:50:33,621 INFO L130 PetriNetUnfolder]: 838/2688 cut-off events. [2022-12-06 05:50:33,621 INFO L131 PetriNetUnfolder]: For 324264/324532 co-relation queries the response was YES. [2022-12-06 05:50:33,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43648 conditions, 2688 events. 838/2688 cut-off events. For 324264/324532 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 27245 event pairs, 123 based on Foata normal form. 8/2641 useless extension candidates. Maximal degree in co-relation 42887. Up to 1043 conditions per place. [2022-12-06 05:50:33,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 381 places, 680 transitions, 22821 flow [2022-12-06 05:50:33,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 1928 [2022-12-06 05:50:33,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:33,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:34,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:34,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 05:50:34,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:34,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:34,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [823] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_495| v_~f~0.base_376))) (let ((.cse8 (select .cse2 (+ v_~f~0.offset_376 (* v_~x1~0_835 4))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_376 (* 4 .cse8))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_376 (* 4 .cse7))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_376 (* 4 .cse4))))) (let ((.cse14 (select .cse2 (+ v_~f~0.offset_376 (* .cse5 4)))) (.cse6 (select .cse2 (+ v_~f~0.offset_376 (* v_~x2~0_543 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_376 (* .cse6 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_376 (* .cse14 4))))) (let ((.cse13 (select .cse2 (+ v_~f~0.offset_376 (* .cse0 4)))) (.cse11 (select .cse2 (+ v_~f~0.offset_376 (* .cse1 4))))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_376 (* .cse11 4)))) (.cse12 (select .cse2 (+ v_~f~0.offset_376 (* .cse13 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_376 (* .cse12 4)))) (.cse9 (select .cse2 (+ v_~f~0.offset_376 (* .cse10 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_384) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_384)) 1 0) 0)) (< 9 (* (mod v_~n~0_383 2147483648) 2)) (= v_~x1~0_833 (select .cse2 (+ v_~f~0.offset_376 (* .cse3 4)))) (not (= (ite (and (< v_~x2~0_543 v_~size~0_384) (<= 0 v_~x2~0_543)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_384)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_384) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_500|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_500| 0)) (not (= (ite (and (<= 0 v_~x1~0_835) (< v_~x1~0_835 v_~size~0_384)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_384)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484|) (= |v_thread1Thread1of1ForFork0_~i~0#1_679| 10) (not (= (ite (and (< .cse6 v_~size~0_384) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_384)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_384) (<= 0 .cse8)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332| 0)) (= v_~x2~0_542 (select .cse2 (+ (* 4 .cse9) v_~f~0.offset_376))) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_384)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_436|) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_384)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_384)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| (ite (and (< .cse9 v_~size~0_384) (<= 0 .cse9)) 1 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_384)) 1 0) 0)) (not (= 0 (ite (and (< .cse14 v_~size~0_384) (<= 0 .cse14)) 1 0)))))))))))))) InVars {~x2~0=v_~x2~0_543, ~size~0=v_~size~0_384, ~f~0.base=v_~f~0.base_376, #memory_int=|v_#memory_int_495|, ~n~0=v_~n~0_383, ~x1~0=v_~x1~0_835, ~f~0.offset=v_~f~0.offset_376} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_502|, ~x2~0=v_~x2~0_542, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_294|, ~size~0=v_~size~0_384, ~f~0.base=v_~f~0.base_376, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_298|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_436|, ~x1~0=v_~x1~0_833, ~f~0.offset=v_~f~0.offset_376, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_679|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_500|, #memory_int=|v_#memory_int_495|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_284|, ~n~0=v_~n~0_383, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_510|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_284|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:35,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_503| v_~f~0.base_380))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_380 (* v_~x1~0_849 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_380 (* .cse4 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_380 (* v_~x2~0_551 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_380 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_337| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_313| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_337|) (not (= (ite (and (< v_~x1~0_849 v_~size~0_388) (<= 0 v_~x1~0_849)) 1 0) 0)) (= v_~x2~0_550 (select .cse0 (+ v_~f~0.offset_380 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x2~0_551) (< v_~x2~0_551 v_~size~0_388)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_388) (<= 0 .cse2)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_380 (* .cse3 4))) v_~x1~0_847) (= |v_thread1Thread1of1ForFork0_~i~0#1_688| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_441|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_388)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_313| (ite (and (< .cse1 v_~size~0_388) (<= 0 .cse1)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_688| 4294967295) 4294967296) (* 2 (mod v_~n~0_387 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_388)) 1 0))))))) InVars {~x2~0=v_~x2~0_551, ~size~0=v_~size~0_388, ~f~0.base=v_~f~0.base_380, #memory_int=|v_#memory_int_503|, ~n~0=v_~n~0_387, ~x1~0=v_~x1~0_849, ~f~0.offset=v_~f~0.offset_380} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_511|, ~x2~0=v_~x2~0_550, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_299|, ~size~0=v_~size~0_388, ~f~0.base=v_~f~0.base_380, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_303|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_313|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_441|, ~x1~0=v_~x1~0_847, ~f~0.offset=v_~f~0.offset_380, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_337|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_688|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509|, #memory_int=|v_#memory_int_503|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_289|, ~n~0=v_~n~0_387, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_519|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_289|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:36,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [854] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_551| v_~f~0.base_418))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_418 (* v_~x1~0_942 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_418 (* .cse0 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_418 (* .cse4 4)))) (.cse3 (select .cse2 (+ v_~f~0.offset_418 (* v_~x2~0_639 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_764| 4294967295) 4294967296) (* (mod v_~n~0_425 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_~i~0#1_764| 4) (not (= (ite (and (< .cse0 v_~size~0_426) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_426)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_552|) (= (select .cse2 (+ v_~f~0.offset_418 (* .cse1 4))) v_~x1~0_940) (= (ite (and (< .cse3 v_~size~0_426) (<= 0 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_371|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_371| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_395|) (not (= (ite (and (<= 0 v_~x2~0_639) (< v_~x2~0_639 v_~size~0_426)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_515|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_426)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_552| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_568|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_395| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_568| 0)) (not (= (ite (and (< v_~x1~0_942 v_~size~0_426) (<= 0 v_~x1~0_942)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_418 (* .cse3 4))) v_~x2~0_638)))))) InVars {~x2~0=v_~x2~0_639, ~size~0=v_~size~0_426, ~f~0.base=v_~f~0.base_418, #memory_int=|v_#memory_int_551|, ~n~0=v_~n~0_425, ~x1~0=v_~x1~0_942, ~f~0.offset=v_~f~0.offset_418} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_570|, ~x2~0=v_~x2~0_638, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_357|, ~size~0=v_~size~0_426, ~f~0.base=v_~f~0.base_418, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_361|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_371|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_515|, ~x1~0=v_~x1~0_940, ~f~0.offset=v_~f~0.offset_418, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_395|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_552|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_764|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_568|, #memory_int=|v_#memory_int_551|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_347|, ~n~0=v_~n~0_425, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_578|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_347|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:36,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_436| v_~f~0.base_328))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_328 (* v_~x2~0_448 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_586| 4294967296) (* (mod v_~n~0_335 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_248| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_424| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_248| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_336)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_408| (ite (and (< v_~x1~0_709 v_~size~0_336) (<= 0 v_~x1~0_709)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_328 (* .cse0 4))) v_~x2~0_447) (= (select .cse1 (+ v_~f~0.offset_328 (* v_~x1~0_709 4))) v_~x1~0_708) (= |v_thread1Thread1of1ForFork0_~i~0#1_585| (+ |v_thread1Thread1of1ForFork0_~i~0#1_586| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_408| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_424|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_363|) (not (= (ite (and (< v_~x2~0_448 v_~size~0_336) (<= 0 v_~x2~0_448)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_448, ~size~0=v_~size~0_336, ~f~0.base=v_~f~0.base_328, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_586|, #memory_int=|v_#memory_int_436|, ~n~0=v_~n~0_335, ~x1~0=v_~x1~0_709, ~f~0.offset=v_~f~0.offset_328} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_426|, ~x2~0=v_~x2~0_447, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_234|, ~size~0=v_~size~0_336, ~f~0.base=v_~f~0.base_328, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_238|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_248|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_363|, ~x1~0=v_~x1~0_708, ~f~0.offset=v_~f~0.offset_328, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_408|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_585|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_424|, #memory_int=|v_#memory_int_436|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_224|, ~n~0=v_~n~0_335, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_434|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_224|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:37,099 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 05:50:37,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4229 [2022-12-06 05:50:37,100 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 675 transitions, 22967 flow [2022-12-06 05:50:37,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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 05:50:37,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:37,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:37,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-06 05:50:37,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-06 05:50:37,306 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:37,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1170180558, now seen corresponding path program 1 times [2022-12-06 05:50:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:37,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055475555] [2022-12-06 05:50:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:39,431 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 05:50:39,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:39,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055475555] [2022-12-06 05:50:39,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055475555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:39,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996435252] [2022-12-06 05:50:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:39,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:39,434 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:50:39,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 05:50:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:39,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:50:39,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:39,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:39,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 266 [2022-12-06 05:50:40,482 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 05:50:40,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:45,213 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-06 05:50:45,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 30 new quantified variables, introduced 120 case distinctions, treesize of input 131 treesize of output 1152 [2022-12-06 05:51:56,368 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 05:51:56,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996435252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:51:56,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:51:56,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 05:51:56,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864382083] [2022-12-06 05:51:56,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:51:56,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:51:56,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:56,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:51:56,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:51:56,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-06 05:51:56,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 675 transitions, 22967 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 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 05:51:56,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:56,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-06 05:51:56,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:00,116 INFO L130 PetriNetUnfolder]: 3488/6748 cut-off events. [2022-12-06 05:52:00,116 INFO L131 PetriNetUnfolder]: For 886768/886768 co-relation queries the response was YES. [2022-12-06 05:52:00,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113672 conditions, 6748 events. 3488/6748 cut-off events. For 886768/886768 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 54622 event pairs, 1436 based on Foata normal form. 5/6751 useless extension candidates. Maximal degree in co-relation 111804. Up to 5730 conditions per place. [2022-12-06 05:52:00,210 INFO L137 encePairwiseOnDemand]: 31/98 looper letters, 562 selfloop transitions, 139 changer transitions 37/738 dead transitions. [2022-12-06 05:52:00,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 738 transitions, 26316 flow [2022-12-06 05:52:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:52:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:52:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2022-12-06 05:52:00,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18877551020408162 [2022-12-06 05:52:00,212 INFO L175 Difference]: Start difference. First operand has 376 places, 675 transitions, 22967 flow. Second operand 8 states and 148 transitions. [2022-12-06 05:52:00,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 738 transitions, 26316 flow [2022-12-06 05:52:03,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 738 transitions, 23458 flow, removed 1401 selfloop flow, removed 4 redundant places. [2022-12-06 05:52:03,925 INFO L231 Difference]: Finished difference. Result has 380 places, 672 transitions, 20899 flow [2022-12-06 05:52:03,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=20573, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=20899, PETRI_PLACES=380, PETRI_TRANSITIONS=672} [2022-12-06 05:52:03,926 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 359 predicate places. [2022-12-06 05:52:03,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:03,926 INFO L89 Accepts]: Start accepts. Operand has 380 places, 672 transitions, 20899 flow [2022-12-06 05:52:03,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:03,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:03,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 380 places, 672 transitions, 20899 flow [2022-12-06 05:52:03,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 378 places, 672 transitions, 20899 flow [2022-12-06 05:52:04,550 INFO L130 PetriNetUnfolder]: 845/2717 cut-off events. [2022-12-06 05:52:04,550 INFO L131 PetriNetUnfolder]: For 296128/296409 co-relation queries the response was YES. [2022-12-06 05:52:04,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41302 conditions, 2717 events. 845/2717 cut-off events. For 296128/296409 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 27639 event pairs, 125 based on Foata normal form. 6/2668 useless extension candidates. Maximal degree in co-relation 40616. Up to 1028 conditions per place. [2022-12-06 05:52:04,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 378 places, 672 transitions, 20899 flow [2022-12-06 05:52:04,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 1888 [2022-12-06 05:52:04,606 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:52:04,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 680 [2022-12-06 05:52:04,606 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 672 transitions, 20899 flow [2022-12-06 05:52:04,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 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 05:52:04,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:04,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:04,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 05:52:04,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-06 05:52:04,812 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash -784479113, now seen corresponding path program 1 times [2022-12-06 05:52:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:04,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699062600] [2022-12-06 05:52:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:04,857 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 05:52:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:04,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699062600] [2022-12-06 05:52:04,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699062600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:52:04,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:52:04,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:52:04,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113842330] [2022-12-06 05:52:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:52:04,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:52:04,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:52:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:52:04,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-06 05:52:04,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 672 transitions, 20899 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:52:04,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:04,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-06 05:52:04,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:07,480 INFO L130 PetriNetUnfolder]: 3452/6676 cut-off events. [2022-12-06 05:52:07,481 INFO L131 PetriNetUnfolder]: For 767918/767918 co-relation queries the response was YES. [2022-12-06 05:52:07,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105627 conditions, 6676 events. 3452/6676 cut-off events. For 767918/767918 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 54062 event pairs, 1667 based on Foata normal form. 8/6682 useless extension candidates. Maximal degree in co-relation 103769. Up to 6547 conditions per place. [2022-12-06 05:52:07,611 INFO L137 encePairwiseOnDemand]: 79/98 looper letters, 651 selfloop transitions, 32 changer transitions 10/693 dead transitions. [2022-12-06 05:52:07,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 693 transitions, 22879 flow [2022-12-06 05:52:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:52:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:52:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-06 05:52:07,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28316326530612246 [2022-12-06 05:52:07,612 INFO L175 Difference]: Start difference. First operand has 378 places, 672 transitions, 20899 flow. Second operand 4 states and 111 transitions. [2022-12-06 05:52:07,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 693 transitions, 22879 flow [2022-12-06 05:52:11,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 693 transitions, 22534 flow, removed 85 selfloop flow, removed 6 redundant places. [2022-12-06 05:52:11,329 INFO L231 Difference]: Finished difference. Result has 376 places, 674 transitions, 20791 flow [2022-12-06 05:52:11,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=20577, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=20791, PETRI_PLACES=376, PETRI_TRANSITIONS=674} [2022-12-06 05:52:11,329 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 355 predicate places. [2022-12-06 05:52:11,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:11,330 INFO L89 Accepts]: Start accepts. Operand has 376 places, 674 transitions, 20791 flow [2022-12-06 05:52:11,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:11,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:11,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 376 places, 674 transitions, 20791 flow [2022-12-06 05:52:11,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 376 places, 674 transitions, 20791 flow [2022-12-06 05:52:12,024 INFO L130 PetriNetUnfolder]: 845/2715 cut-off events. [2022-12-06 05:52:12,025 INFO L131 PetriNetUnfolder]: For 278499/278780 co-relation queries the response was YES. [2022-12-06 05:52:12,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40516 conditions, 2715 events. 845/2715 cut-off events. For 278499/278780 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 27710 event pairs, 127 based on Foata normal form. 3/2664 useless extension candidates. Maximal degree in co-relation 39762. Up to 1027 conditions per place. [2022-12-06 05:52:12,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 376 places, 674 transitions, 20791 flow [2022-12-06 05:52:12,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 1892 [2022-12-06 05:52:12,081 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:52:12,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 752 [2022-12-06 05:52:12,081 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 674 transitions, 20791 flow [2022-12-06 05:52:12,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:52:12,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:12,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:12,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 05:52:12,082 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:12,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash -514964841, now seen corresponding path program 1 times [2022-12-06 05:52:12,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:12,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259471106] [2022-12-06 05:52:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:12,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:12,127 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 05:52:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:12,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259471106] [2022-12-06 05:52:12,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259471106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:12,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771869544] [2022-12-06 05:52:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:12,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:12,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:12,132 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:52:12,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 05:52:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:12,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:52:12,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:12,306 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 05:52:12,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:12,327 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 05:52:12,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771869544] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:12,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:52:12,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2022-12-06 05:52:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396837490] [2022-12-06 05:52:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:52:12,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:52:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:12,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:52:12,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:52:12,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-06 05:52:12,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 674 transitions, 20791 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:52:12,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:12,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-06 05:52:12,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:14,972 INFO L130 PetriNetUnfolder]: 3508/6837 cut-off events. [2022-12-06 05:52:14,972 INFO L131 PetriNetUnfolder]: For 744478/744478 co-relation queries the response was YES. [2022-12-06 05:52:15,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105516 conditions, 6837 events. 3508/6837 cut-off events. For 744478/744478 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 55950 event pairs, 833 based on Foata normal form. 42/6877 useless extension candidates. Maximal degree in co-relation 103034. Up to 4253 conditions per place. [2022-12-06 05:52:15,061 INFO L137 encePairwiseOnDemand]: 65/98 looper letters, 531 selfloop transitions, 197 changer transitions 11/739 dead transitions. [2022-12-06 05:52:15,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 739 transitions, 24034 flow [2022-12-06 05:52:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:52:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:52:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-12-06 05:52:15,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3010204081632653 [2022-12-06 05:52:15,062 INFO L175 Difference]: Start difference. First operand has 376 places, 674 transitions, 20791 flow. Second operand 4 states and 118 transitions. [2022-12-06 05:52:15,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 739 transitions, 24034 flow [2022-12-06 05:52:17,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 739 transitions, 23946 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-06 05:52:17,946 INFO L231 Difference]: Finished difference. Result has 381 places, 706 transitions, 22577 flow [2022-12-06 05:52:17,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=20707, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=22577, PETRI_PLACES=381, PETRI_TRANSITIONS=706} [2022-12-06 05:52:17,947 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 360 predicate places. [2022-12-06 05:52:17,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:17,947 INFO L89 Accepts]: Start accepts. Operand has 381 places, 706 transitions, 22577 flow [2022-12-06 05:52:17,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:17,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:17,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 381 places, 706 transitions, 22577 flow [2022-12-06 05:52:17,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 381 places, 706 transitions, 22577 flow [2022-12-06 05:52:18,669 INFO L130 PetriNetUnfolder]: 842/2778 cut-off events. [2022-12-06 05:52:18,669 INFO L131 PetriNetUnfolder]: For 305533/305823 co-relation queries the response was YES. [2022-12-06 05:52:18,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42660 conditions, 2778 events. 842/2778 cut-off events. For 305533/305823 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 28746 event pairs, 117 based on Foata normal form. 8/2729 useless extension candidates. Maximal degree in co-relation 41609. Up to 1027 conditions per place. [2022-12-06 05:52:18,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 381 places, 706 transitions, 22577 flow [2022-12-06 05:52:18,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 2014 [2022-12-06 05:52:18,730 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:52:18,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 783 [2022-12-06 05:52:18,730 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 706 transitions, 22577 flow [2022-12-06 05:52:18,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:52:18,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:18,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:18,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 05:52:18,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:18,932 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 620631458, now seen corresponding path program 1 times [2022-12-06 05:52:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:18,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532366785] [2022-12-06 05:52:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:19,007 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 05:52:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:19,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532366785] [2022-12-06 05:52:19,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532366785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:19,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22803626] [2022-12-06 05:52:19,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:19,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:19,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:19,008 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:52:19,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 05:52:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:19,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:52:19,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:19,166 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 05:52:19,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:19,197 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 05:52:19,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22803626] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:19,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:19,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:52:19,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645849756] [2022-12-06 05:52:19,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:19,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:52:19,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:19,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:52:19,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:52:19,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-06 05:52:19,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 706 transitions, 22577 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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 05:52:19,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:19,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-06 05:52:19,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:22,696 INFO L130 PetriNetUnfolder]: 3631/7075 cut-off events. [2022-12-06 05:52:22,696 INFO L131 PetriNetUnfolder]: For 860100/860100 co-relation queries the response was YES. [2022-12-06 05:52:22,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114695 conditions, 7075 events. 3631/7075 cut-off events. For 860100/860100 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 57903 event pairs, 1153 based on Foata normal form. 64/7137 useless extension candidates. Maximal degree in co-relation 112039. Up to 5016 conditions per place. [2022-12-06 05:52:22,789 INFO L137 encePairwiseOnDemand]: 24/98 looper letters, 520 selfloop transitions, 307 changer transitions 13/840 dead transitions. [2022-12-06 05:52:22,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 840 transitions, 28503 flow [2022-12-06 05:52:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:52:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:52:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 180 transitions. [2022-12-06 05:52:22,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10804321728691477 [2022-12-06 05:52:22,791 INFO L175 Difference]: Start difference. First operand has 381 places, 706 transitions, 22577 flow. Second operand 17 states and 180 transitions. [2022-12-06 05:52:22,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 840 transitions, 28503 flow [2022-12-06 05:52:26,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 840 transitions, 28283 flow, removed 96 selfloop flow, removed 2 redundant places. [2022-12-06 05:52:26,679 INFO L231 Difference]: Finished difference. Result has 403 places, 729 transitions, 24337 flow [2022-12-06 05:52:26,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=22357, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=24337, PETRI_PLACES=403, PETRI_TRANSITIONS=729} [2022-12-06 05:52:26,680 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 382 predicate places. [2022-12-06 05:52:26,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:26,680 INFO L89 Accepts]: Start accepts. Operand has 403 places, 729 transitions, 24337 flow [2022-12-06 05:52:26,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:26,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:26,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 729 transitions, 24337 flow [2022-12-06 05:52:26,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 403 places, 729 transitions, 24337 flow [2022-12-06 05:52:27,371 INFO L130 PetriNetUnfolder]: 878/2878 cut-off events. [2022-12-06 05:52:27,371 INFO L131 PetriNetUnfolder]: For 337940/338300 co-relation queries the response was YES. [2022-12-06 05:52:27,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46180 conditions, 2878 events. 878/2878 cut-off events. For 337940/338300 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 29849 event pairs, 121 based on Foata normal form. 8/2826 useless extension candidates. Maximal degree in co-relation 45107. Up to 1082 conditions per place. [2022-12-06 05:52:27,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 729 transitions, 24337 flow [2022-12-06 05:52:27,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 2054 [2022-12-06 05:52:27,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:27,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:52:27,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 886 [2022-12-06 05:52:27,566 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 729 transitions, 24393 flow [2022-12-06 05:52:27,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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 05:52:27,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:27,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:27,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-06 05:52:27,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:27,771 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash -480158252, now seen corresponding path program 1 times [2022-12-06 05:52:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:27,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643380014] [2022-12-06 05:52:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52: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 05:52:28,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:28,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643380014] [2022-12-06 05:52:28,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643380014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:52:28,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:52:28,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:52:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531028227] [2022-12-06 05:52:28,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:52:28,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:52:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:28,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:52:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:52:28,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 99 [2022-12-06 05:52:28,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 729 transitions, 24393 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:52:28,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:28,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 99 [2022-12-06 05:52:28,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:32,935 INFO L130 PetriNetUnfolder]: 3671/7153 cut-off events. [2022-12-06 05:52:32,935 INFO L131 PetriNetUnfolder]: For 865259/865259 co-relation queries the response was YES. [2022-12-06 05:52:32,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117626 conditions, 7153 events. 3671/7153 cut-off events. For 865259/865259 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 58780 event pairs, 1519 based on Foata normal form. 3/7154 useless extension candidates. Maximal degree in co-relation 115251. Up to 6180 conditions per place. [2022-12-06 05:52:33,030 INFO L137 encePairwiseOnDemand]: 34/99 looper letters, 609 selfloop transitions, 144 changer transitions 33/786 dead transitions. [2022-12-06 05:52:33,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 786 transitions, 27390 flow [2022-12-06 05:52:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:52:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:52:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2022-12-06 05:52:33,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1976911976911977 [2022-12-06 05:52:33,031 INFO L175 Difference]: Start difference. First operand has 403 places, 729 transitions, 24393 flow. Second operand 7 states and 137 transitions. [2022-12-06 05:52:33,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 786 transitions, 27390 flow [2022-12-06 05:52:37,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 786 transitions, 26902 flow, removed 231 selfloop flow, removed 3 redundant places. [2022-12-06 05:52:37,036 INFO L231 Difference]: Finished difference. Result has 408 places, 734 transitions, 24497 flow [2022-12-06 05:52:37,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=23917, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24497, PETRI_PLACES=408, PETRI_TRANSITIONS=734} [2022-12-06 05:52:37,037 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 387 predicate places. [2022-12-06 05:52:37,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:37,037 INFO L89 Accepts]: Start accepts. Operand has 408 places, 734 transitions, 24497 flow [2022-12-06 05:52:37,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:37,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:37,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 408 places, 734 transitions, 24497 flow [2022-12-06 05:52:37,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 408 places, 734 transitions, 24497 flow [2022-12-06 05:52:37,739 INFO L130 PetriNetUnfolder]: 886/2907 cut-off events. [2022-12-06 05:52:37,739 INFO L131 PetriNetUnfolder]: For 331867/332227 co-relation queries the response was YES. [2022-12-06 05:52:37,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46134 conditions, 2907 events. 886/2907 cut-off events. For 331867/332227 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30152 event pairs, 123 based on Foata normal form. 8/2854 useless extension candidates. Maximal degree in co-relation 45163. Up to 1082 conditions per place. [2022-12-06 05:52:37,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 408 places, 734 transitions, 24497 flow [2022-12-06 05:52:37,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 2066 [2022-12-06 05:52:37,881 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:52:37,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 844 [2022-12-06 05:52:37,881 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 734 transitions, 24497 flow [2022-12-06 05:52:37,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 05:52:37,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:37,881 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:37,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 05:52:37,881 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash 632290355, now seen corresponding path program 2 times [2022-12-06 05:52:37,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:37,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005812017] [2022-12-06 05:52:37,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:37,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005812017] [2022-12-06 05:52:37,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005812017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043689490] [2022-12-06 05:52:37,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:52:37,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:37,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:37,966 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:52:37,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 05:52:38,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:52:38,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:52:38,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:52:38,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:38,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:38,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043689490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:38,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:38,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 05:52:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319045194] [2022-12-06 05:52:38,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:38,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:52:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:38,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:52:38,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:52:38,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 99 [2022-12-06 05:52:38,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 734 transitions, 24497 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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 05:52:38,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:38,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 99 [2022-12-06 05:52:38,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:44,284 INFO L130 PetriNetUnfolder]: 3919/7870 cut-off events. [2022-12-06 05:52:44,285 INFO L131 PetriNetUnfolder]: For 954591/954591 co-relation queries the response was YES. [2022-12-06 05:52:44,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128986 conditions, 7870 events. 3919/7870 cut-off events. For 954591/954591 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 68034 event pairs, 530 based on Foata normal form. 96/7964 useless extension candidates. Maximal degree in co-relation 126736. Up to 4156 conditions per place. [2022-12-06 05:52:44,390 INFO L137 encePairwiseOnDemand]: 20/99 looper letters, 516 selfloop transitions, 515 changer transitions 42/1073 dead transitions. [2022-12-06 05:52:44,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 1073 transitions, 37901 flow [2022-12-06 05:52:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 05:52:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 05:52:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 288 transitions. [2022-12-06 05:52:44,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0881542699724518 [2022-12-06 05:52:44,392 INFO L175 Difference]: Start difference. First operand has 408 places, 734 transitions, 24497 flow. Second operand 33 states and 288 transitions. [2022-12-06 05:52:44,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 1073 transitions, 37901 flow [2022-12-06 05:52:48,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1073 transitions, 37671 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 05:52:48,482 INFO L231 Difference]: Finished difference. Result has 456 places, 917 transitions, 33613 flow [2022-12-06 05:52:48,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=24240, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=33613, PETRI_PLACES=456, PETRI_TRANSITIONS=917} [2022-12-06 05:52:48,483 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 435 predicate places. [2022-12-06 05:52:48,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:48,483 INFO L89 Accepts]: Start accepts. Operand has 456 places, 917 transitions, 33613 flow [2022-12-06 05:52:48,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:48,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:48,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 456 places, 917 transitions, 33613 flow [2022-12-06 05:52:48,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 917 transitions, 33613 flow [2022-12-06 05:52:49,556 INFO L130 PetriNetUnfolder]: 977/3279 cut-off events. [2022-12-06 05:52:49,556 INFO L131 PetriNetUnfolder]: For 465223/465255 co-relation queries the response was YES. [2022-12-06 05:52:49,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57020 conditions, 3279 events. 977/3279 cut-off events. For 465223/465255 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 34821 event pairs, 91 based on Foata normal form. 7/3255 useless extension candidates. Maximal degree in co-relation 55910. Up to 1248 conditions per place. [2022-12-06 05:52:49,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 456 places, 917 transitions, 33613 flow [2022-12-06 05:52:49,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 2398 [2022-12-06 05:52:49,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:49,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:49,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:50,042 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:52:50,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1560 [2022-12-06 05:52:50,043 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 916 transitions, 33725 flow [2022-12-06 05:52:50,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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 05:52:50,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:50,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:50,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 05:52:50,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-12-06 05:52:50,248 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1013738994, now seen corresponding path program 1 times [2022-12-06 05:52:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:50,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120968035] [2022-12-06 05:52:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:54,124 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 05:52:54,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:54,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120968035] [2022-12-06 05:52:54,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120968035] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:54,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398743622] [2022-12-06 05:52:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:54,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:54,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:54,126 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:52:54,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 05:52:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:54,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:52:54,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:54,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:52:54,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-12-06 05:52:54,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:52:54,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 05:52:54,436 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 05:52:54,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:54,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:52:54,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 364 [2022-12-06 05:52:54,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:52:54,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-06 05:52:57,259 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 05:52:57,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398743622] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:57,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:57,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:52:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502597080] [2022-12-06 05:52:57,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:57,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:52:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:57,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:52:57,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=169, Unknown=2, NotChecked=0, Total=210 [2022-12-06 05:52:57,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 102 [2022-12-06 05:52:57,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 916 transitions, 33725 flow. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 05:52:57,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:57,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 102 [2022-12-06 05:52:57,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:53:05,394 INFO L130 PetriNetUnfolder]: 3851/7720 cut-off events. [2022-12-06 05:53:05,394 INFO L131 PetriNetUnfolder]: For 1099459/1099459 co-relation queries the response was YES. [2022-12-06 05:53:05,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134749 conditions, 7720 events. 3851/7720 cut-off events. For 1099459/1099459 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 65909 event pairs, 1481 based on Foata normal form. 2/7720 useless extension candidates. Maximal degree in co-relation 131728. Up to 6958 conditions per place. [2022-12-06 05:53:05,507 INFO L137 encePairwiseOnDemand]: 28/102 looper letters, 755 selfloop transitions, 199 changer transitions 37/991 dead transitions. [2022-12-06 05:53:05,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 991 transitions, 37357 flow [2022-12-06 05:53:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:53:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:53:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions. [2022-12-06 05:53:05,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14705882352941177 [2022-12-06 05:53:05,508 INFO L175 Difference]: Start difference. First operand has 455 places, 916 transitions, 33725 flow. Second operand 12 states and 180 transitions. [2022-12-06 05:53:05,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 991 transitions, 37357 flow [2022-12-06 05:53:11,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 991 transitions, 34024 flow, removed 1624 selfloop flow, removed 6 redundant places. [2022-12-06 05:53:11,493 INFO L231 Difference]: Finished difference. Result has 461 places, 915 transitions, 30991 flow [2022-12-06 05:53:11,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=30512, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=30991, PETRI_PLACES=461, PETRI_TRANSITIONS=915} [2022-12-06 05:53:11,494 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 440 predicate places. [2022-12-06 05:53:11,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:53:11,494 INFO L89 Accepts]: Start accepts. Operand has 461 places, 915 transitions, 30991 flow [2022-12-06 05:53:11,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:53:11,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:53:11,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 461 places, 915 transitions, 30991 flow [2022-12-06 05:53:11,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 915 transitions, 30991 flow [2022-12-06 05:53:12,448 INFO L130 PetriNetUnfolder]: 975/3262 cut-off events. [2022-12-06 05:53:12,449 INFO L131 PetriNetUnfolder]: For 430713/430752 co-relation queries the response was YES. [2022-12-06 05:53:12,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53666 conditions, 3262 events. 975/3262 cut-off events. For 430713/430752 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 34493 event pairs, 90 based on Foata normal form. 7/3239 useless extension candidates. Maximal degree in co-relation 52806. Up to 1146 conditions per place. [2022-12-06 05:53:12,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 460 places, 915 transitions, 30991 flow [2022-12-06 05:53:12,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 2390 [2022-12-06 05:53:13,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_530| v_~f~0.base_398))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_398 (* v_~x1~0_909 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_398 (* .cse9 4))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_398 (* v_~x2~0_600 4)))) (.cse3 (select .cse4 (+ v_~f~0.offset_398 (* .cse1 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_398 (* .cse3 4)))) (.cse11 (select .cse4 (+ v_~f~0.offset_398 (* .cse7 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_398 (* .cse11 4)))) (.cse8 (select .cse4 (+ v_~f~0.offset_398 (* .cse2 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_398 (* 4 .cse8)))) (.cse12 (select .cse4 (+ (* .cse10 4) v_~f~0.offset_398)))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_398 (* .cse12 4)))) (.cse5 (select .cse4 (+ v_~f~0.offset_398 (* .cse6 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (and (< .cse0 v_~size~0_406) (<= 0 .cse0)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_406)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_406)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370| 0)) (< 7 (* (mod v_~n~0_405 2147483648) 2)) (not (= (ite (and (< .cse3 v_~size~0_406) (<= 0 .cse3)) 1 0) 0)) (= v_~x2~0_598 (select .cse4 (+ v_~f~0.offset_398 (* .cse0 4)))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_477|) (= v_~x1~0_907 (select .cse4 (+ v_~f~0.offset_398 (* 4 .cse5)))) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_406)) 1 0))) (not (= (ite (and (< v_~x2~0_600 v_~size~0_406) (<= 0 v_~x2~0_600)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_406)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_406) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_406)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_406) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_406) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_533| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_406)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_533| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549|) (not (= (ite (and (< v_~x1~0_909 v_~size~0_406) (<= 0 v_~x1~0_909)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_406) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_730| 8)))))))))) InVars {~x2~0=v_~x2~0_600, ~size~0=v_~size~0_406, ~f~0.base=v_~f~0.base_398, #memory_int=|v_#memory_int_530|, ~n~0=v_~n~0_405, ~x1~0=v_~x1~0_909, ~f~0.offset=v_~f~0.offset_398} OutVars{~x2~0=v_~x2~0_598, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_551|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_332|, ~size~0=v_~size~0_406, ~f~0.base=v_~f~0.base_398, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_336|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_477|, ~x1~0=v_~x1~0_907, ~f~0.offset=v_~f~0.offset_398, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_533|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_730|, #memory_int=|v_#memory_int_530|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_322|, ~n~0=v_~n~0_405, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_322|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_559|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:53:14,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:53:14,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3260 [2022-12-06 05:53:14,754 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 915 transitions, 31047 flow [2022-12-06 05:53:14,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 05:53:14,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:53:14,754 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:53:14,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 05:53:14,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:53:14,960 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:53:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:53:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1248709089, now seen corresponding path program 3 times [2022-12-06 05:53:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:53:14,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878305019] [2022-12-06 05:53:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:53:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:53:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:53:15,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:53:15,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878305019] [2022-12-06 05:53:15,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878305019] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:53:15,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833554743] [2022-12-06 05:53:15,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:53:15,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:53:15,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:53:15,069 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:53:15,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 05:53:15,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 05:53:15,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:53:15,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:53:15,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:53:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:53:15,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:53:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:53:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833554743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:53:15,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:53:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-12-06 05:53:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621061829] [2022-12-06 05:53:15,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:53:15,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:53:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:53:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:53:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:53:15,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 104 [2022-12-06 05:53:15,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 915 transitions, 31047 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:53:15,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:53:15,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 104 [2022-12-06 05:53:15,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:53:18,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:19,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:21,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:26,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:28,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:32,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:34,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:36,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:37,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:39,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:41,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:44,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:46,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:48,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:51,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:53,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:55,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:57,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:59,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:01,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:03,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:16,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:18,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:20,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:22,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:24,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:26,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:28,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:31,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:33,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:35,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:37,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:40,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:41,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:43,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:45,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:47,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:49,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:51,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:53,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:56,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:58,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:55:00,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:55:02,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:55:04,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:55:28,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:55:42,909 INFO L130 PetriNetUnfolder]: 3725/8180 cut-off events. [2022-12-06 05:55:42,909 INFO L131 PetriNetUnfolder]: For 1015784/1015784 co-relation queries the response was YES. [2022-12-06 05:55:42,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130638 conditions, 8180 events. 3725/8180 cut-off events. For 1015784/1015784 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 76358 event pairs, 368 based on Foata normal form. 12/8190 useless extension candidates. Maximal degree in co-relation 128744. Up to 5386 conditions per place. [2022-12-06 05:55:43,021 INFO L137 encePairwiseOnDemand]: 34/104 looper letters, 619 selfloop transitions, 393 changer transitions 22/1034 dead transitions. [2022-12-06 05:55:43,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 1034 transitions, 36042 flow [2022-12-06 05:55:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:55:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:55:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 183 transitions. [2022-12-06 05:55:43,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09775641025641026 [2022-12-06 05:55:43,022 INFO L175 Difference]: Start difference. First operand has 460 places, 915 transitions, 31047 flow. Second operand 18 states and 183 transitions. [2022-12-06 05:55:43,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 1034 transitions, 36042 flow [2022-12-06 05:55:47,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 1034 transitions, 35692 flow, removed 70 selfloop flow, removed 4 redundant places. [2022-12-06 05:55:47,359 INFO L231 Difference]: Finished difference. Result has 479 places, 963 transitions, 33277 flow [2022-12-06 05:55:47,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=30729, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=33277, PETRI_PLACES=479, PETRI_TRANSITIONS=963} [2022-12-06 05:55:47,360 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 458 predicate places. [2022-12-06 05:55:47,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:55:47,360 INFO L89 Accepts]: Start accepts. Operand has 479 places, 963 transitions, 33277 flow [2022-12-06 05:55:47,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:55:47,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:55:47,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 479 places, 963 transitions, 33277 flow [2022-12-06 05:55:47,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 963 transitions, 33277 flow [2022-12-06 05:55:48,482 INFO L130 PetriNetUnfolder]: 980/3880 cut-off events. [2022-12-06 05:55:48,482 INFO L131 PetriNetUnfolder]: For 528661/528969 co-relation queries the response was YES. [2022-12-06 05:55:48,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61685 conditions, 3880 events. 980/3880 cut-off events. For 528661/528969 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 45144 event pairs, 89 based on Foata normal form. 35/3880 useless extension candidates. Maximal degree in co-relation 61135. Up to 1280 conditions per place. [2022-12-06 05:55:48,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 476 places, 963 transitions, 33277 flow [2022-12-06 05:55:48,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 2424 [2022-12-06 05:55:48,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:55:48,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:55:48,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:55:48,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1441 [2022-12-06 05:55:48,801 INFO L495 AbstractCegarLoop]: Abstraction has has 476 places, 963 transitions, 33429 flow [2022-12-06 05:55:48,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:55:48,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:55:48,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:55:48,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-06 05:55:49,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:55:49,006 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:55:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:55:49,006 INFO L85 PathProgramCache]: Analyzing trace with hash -207515423, now seen corresponding path program 1 times [2022-12-06 05:55:49,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:55:49,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772820756] [2022-12-06 05:55:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:55:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:55:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:55:49,093 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 05:55:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:55:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772820756] [2022-12-06 05:55:49,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772820756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:55:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539221574] [2022-12-06 05:55:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:55:49,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:55:49,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:55:49,096 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:55:49,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 05:55:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:55:49,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:55:49,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:55:49,425 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 05:55:49,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:55:49,454 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 05:55:49,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539221574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:55:49,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:55:49,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:55:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761226647] [2022-12-06 05:55:49,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:55:49,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:55:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:55:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:55:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:55:49,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 105 [2022-12-06 05:55:49,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 963 transitions, 33429 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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 05:55:49,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:55:49,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 105 [2022-12-06 05:55:49,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:55:55,442 INFO L130 PetriNetUnfolder]: 3765/8138 cut-off events. [2022-12-06 05:55:55,442 INFO L131 PetriNetUnfolder]: For 1133480/1133480 co-relation queries the response was YES. [2022-12-06 05:55:55,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136153 conditions, 8138 events. 3765/8138 cut-off events. For 1133480/1133480 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 74585 event pairs, 1125 based on Foata normal form. 128/8264 useless extension candidates. Maximal degree in co-relation 135297. Up to 5318 conditions per place. [2022-12-06 05:55:55,562 INFO L137 encePairwiseOnDemand]: 23/105 looper letters, 598 selfloop transitions, 465 changer transitions 12/1075 dead transitions. [2022-12-06 05:55:55,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 1075 transitions, 39849 flow [2022-12-06 05:55:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:55:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:55:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-12-06 05:55:55,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.126007326007326 [2022-12-06 05:55:55,565 INFO L175 Difference]: Start difference. First operand has 476 places, 963 transitions, 33429 flow. Second operand 13 states and 172 transitions. [2022-12-06 05:55:55,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 1075 transitions, 39849 flow [2022-12-06 05:56:01,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 1075 transitions, 39071 flow, removed 372 selfloop flow, removed 4 redundant places. [2022-12-06 05:56:01,517 INFO L231 Difference]: Finished difference. Result has 490 places, 984 transitions, 35505 flow [2022-12-06 05:56:01,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=32280, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35505, PETRI_PLACES=490, PETRI_TRANSITIONS=984} [2022-12-06 05:56:01,518 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 469 predicate places. [2022-12-06 05:56:01,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:56:01,518 INFO L89 Accepts]: Start accepts. Operand has 490 places, 984 transitions, 35505 flow [2022-12-06 05:56:01,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:56:01,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:56:01,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 490 places, 984 transitions, 35505 flow [2022-12-06 05:56:01,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 490 places, 984 transitions, 35505 flow [2022-12-06 05:56:02,696 INFO L130 PetriNetUnfolder]: 1002/3869 cut-off events. [2022-12-06 05:56:02,696 INFO L131 PetriNetUnfolder]: For 545638/545955 co-relation queries the response was YES. [2022-12-06 05:56:02,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63672 conditions, 3869 events. 1002/3869 cut-off events. For 545638/545955 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 44603 event pairs, 87 based on Foata normal form. 41/3877 useless extension candidates. Maximal degree in co-relation 63168. Up to 1259 conditions per place. [2022-12-06 05:56:02,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 490 places, 984 transitions, 35505 flow [2022-12-06 05:56:02,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 2442 [2022-12-06 05:56:04,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [865] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_572| v_~f~0.base_434))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_434 (* v_~x1~0_986 4)))) (.cse8 (select .cse2 (+ v_~f~0.offset_434 (* v_~x2~0_678 4))))) (let ((.cse11 (select .cse2 (+ v_~f~0.offset_434 (* .cse8 4)))) (.cse5 (select .cse2 (+ v_~f~0.offset_434 (* 4 .cse7))))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_434 (* .cse5 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_434 (* .cse11 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_434 (* .cse1 4)))) (.cse10 (select .cse2 (+ v_~f~0.offset_434 (* .cse9 4))))) (let ((.cse12 (select .cse2 (+ v_~f~0.offset_434 (* .cse10 4)))) (.cse4 (select .cse2 (+ v_~f~0.offset_434 (* .cse6 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_434 (* 4 .cse4)))) (.cse14 (select .cse2 (+ v_~f~0.offset_434 (* .cse12 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_434 (* .cse14 4)))) (.cse13 (select .cse2 (+ v_~f~0.offset_434 (* .cse3 4))))) (and (not (= 0 (ite (and (<= 0 v_~x1~0_986) (< v_~x1~0_986 v_~size~0_442)) 1 0))) (not (= (ite (and (<= 0 v_~x2~0_678) (< v_~x2~0_678 v_~size~0_442)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_581| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_442)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_423|) (< 6 (* 2 (mod v_~n~0_441 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_597| 0)) (not (= (ite (and (< .cse1 v_~size~0_442) (<= 0 .cse1)) 1 0) 0)) (= v_~x1~0_985 (select .cse2 (+ v_~f~0.offset_434 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_552| 8) (not (= 0 (ite (and (< .cse3 v_~size~0_442) (<= 0 .cse3)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_581| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_597|) (not (= (ite (and (< .cse4 v_~size~0_442) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_442) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_442) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_442)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_423| 0)) (not (= (ite (and (< .cse8 v_~size~0_442) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_442) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_442) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_442) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_442) (<= 0 .cse12)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399| (ite (and (< .cse13 v_~size~0_442) (<= 0 .cse13)) 1 0)) (= (select .cse2 (+ v_~f~0.offset_434 (* 4 .cse13))) v_~x2~0_676) (= |v_thread1Thread1of1ForFork0_~i~0#1_806| 8) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_442)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_678, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_434, #memory_int=|v_#memory_int_572|, ~n~0=v_~n~0_441, ~x1~0=v_~x1~0_986, ~f~0.offset=v_~f~0.offset_434} OutVars{~x2~0=v_~x2~0_676, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_599|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_385|, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_434, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_389|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_552|, ~x1~0=v_~x1~0_985, ~f~0.offset=v_~f~0.offset_434, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_423|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_581|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_806|, #memory_int=|v_#memory_int_572|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_597|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_375|, ~n~0=v_~n~0_441, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_375|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_607|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:56:05,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:56:05,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4040 [2022-12-06 05:56:05,558 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 984 transitions, 35545 flow [2022-12-06 05:56:05,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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 05:56:05,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:56:05,559 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:56:05,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-06 05:56:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-12-06 05:56:05,759 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:56:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:56:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -410570638, now seen corresponding path program 1 times [2022-12-06 05:56:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:56:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777879434] [2022-12-06 05:56:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:56:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:56:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777879434] [2022-12-06 05:56:05,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777879434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:56:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003277663] [2022-12-06 05:56:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:56:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:56:05,821 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:56:05,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 05:56:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:05,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:56:05,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:56:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:05,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:56:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:06,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003277663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:56:06,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:56:06,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 05:56:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115352598] [2022-12-06 05:56:06,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:56:06,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:56:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:56:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:56:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:56:06,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 106 [2022-12-06 05:56:06,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 984 transitions, 35545 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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 05:56:06,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:56:06,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 106 [2022-12-06 05:56:06,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:56:11,024 INFO L130 PetriNetUnfolder]: 3762/8149 cut-off events. [2022-12-06 05:56:11,024 INFO L131 PetriNetUnfolder]: For 1105065/1105065 co-relation queries the response was YES. [2022-12-06 05:56:11,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138035 conditions, 8149 events. 3762/8149 cut-off events. For 1105065/1105065 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 75147 event pairs, 329 based on Foata normal form. 8/8155 useless extension candidates. Maximal degree in co-relation 137213. Up to 3537 conditions per place. [2022-12-06 05:56:11,140 INFO L137 encePairwiseOnDemand]: 37/106 looper letters, 810 selfloop transitions, 275 changer transitions 14/1099 dead transitions. [2022-12-06 05:56:11,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 1099 transitions, 41431 flow [2022-12-06 05:56:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:56:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:56:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-12-06 05:56:11,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16352201257861634 [2022-12-06 05:56:11,141 INFO L175 Difference]: Start difference. First operand has 490 places, 984 transitions, 35545 flow. Second operand 9 states and 156 transitions. [2022-12-06 05:56:11,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 1099 transitions, 41431 flow [2022-12-06 05:56:16,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 1099 transitions, 40403 flow, removed 468 selfloop flow, removed 4 redundant places. [2022-12-06 05:56:16,922 INFO L231 Difference]: Finished difference. Result has 496 places, 986 transitions, 35193 flow [2022-12-06 05:56:16,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=34595, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=35193, PETRI_PLACES=496, PETRI_TRANSITIONS=986} [2022-12-06 05:56:16,923 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 475 predicate places. [2022-12-06 05:56:16,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:56:16,924 INFO L89 Accepts]: Start accepts. Operand has 496 places, 986 transitions, 35193 flow [2022-12-06 05:56:16,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:56:16,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:56:16,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 496 places, 986 transitions, 35193 flow [2022-12-06 05:56:16,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 986 transitions, 35193 flow [2022-12-06 05:56:18,076 INFO L130 PetriNetUnfolder]: 1000/3866 cut-off events. [2022-12-06 05:56:18,077 INFO L131 PetriNetUnfolder]: For 545851/546162 co-relation queries the response was YES. [2022-12-06 05:56:18,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63427 conditions, 3866 events. 1000/3866 cut-off events. For 545851/546162 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 44544 event pairs, 87 based on Foata normal form. 35/3867 useless extension candidates. Maximal degree in co-relation 63130. Up to 1248 conditions per place. [2022-12-06 05:56:18,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 493 places, 986 transitions, 35193 flow [2022-12-06 05:56:18,163 INFO L188 LiptonReduction]: Number of co-enabled transitions 2446 [2022-12-06 05:56:18,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:56:18,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1242 [2022-12-06 05:56:18,166 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 986 transitions, 35193 flow [2022-12-06 05:56:18,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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 05:56:18,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:56:18,166 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:56:18,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-06 05:56:18,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:56:18,371 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:56:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:56:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash -544504625, now seen corresponding path program 1 times [2022-12-06 05:56:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:56:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561128539] [2022-12-06 05:56:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:56:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:18,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:56:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561128539] [2022-12-06 05:56:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561128539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:56:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350567535] [2022-12-06 05:56:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:18,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:56:18,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:56:18,442 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:56:18,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 05:56:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:18,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:56:18,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:56:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:18,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:56:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:18,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350567535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:56:18,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:56:18,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-12-06 05:56:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228875790] [2022-12-06 05:56:18,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:56:18,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:56:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:56:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:56:18,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:56:18,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 103 [2022-12-06 05:56:18,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 986 transitions, 35193 flow. Second operand has 11 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 05:56:18,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:56:18,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 103 [2022-12-06 05:56:18,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:56:20,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:23,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:26,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:29,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:34,339 INFO L130 PetriNetUnfolder]: 4124/8996 cut-off events. [2022-12-06 05:56:34,339 INFO L131 PetriNetUnfolder]: For 1316366/1316366 co-relation queries the response was YES. [2022-12-06 05:56:34,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155404 conditions, 8996 events. 4124/8996 cut-off events. For 1316366/1316366 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 84703 event pairs, 1163 based on Foata normal form. 62/9056 useless extension candidates. Maximal degree in co-relation 155021. Up to 5723 conditions per place. [2022-12-06 05:56:34,467 INFO L137 encePairwiseOnDemand]: 22/103 looper letters, 620 selfloop transitions, 530 changer transitions 13/1163 dead transitions. [2022-12-06 05:56:34,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 1163 transitions, 43682 flow [2022-12-06 05:56:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:56:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:56:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 202 transitions. [2022-12-06 05:56:34,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11536264991433466 [2022-12-06 05:56:34,469 INFO L175 Difference]: Start difference. First operand has 493 places, 986 transitions, 35193 flow. Second operand 17 states and 202 transitions. [2022-12-06 05:56:34,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 1163 transitions, 43682 flow [2022-12-06 05:56:41,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 1163 transitions, 43444 flow, removed 119 selfloop flow, removed 3 redundant places. [2022-12-06 05:56:41,213 INFO L231 Difference]: Finished difference. Result has 514 places, 1049 transitions, 39742 flow [2022-12-06 05:56:41,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=35000, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=477, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=39742, PETRI_PLACES=514, PETRI_TRANSITIONS=1049} [2022-12-06 05:56:41,214 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 493 predicate places. [2022-12-06 05:56:41,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:56:41,214 INFO L89 Accepts]: Start accepts. Operand has 514 places, 1049 transitions, 39742 flow [2022-12-06 05:56:41,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:56:41,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:56:41,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 514 places, 1049 transitions, 39742 flow [2022-12-06 05:56:41,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 514 places, 1049 transitions, 39742 flow [2022-12-06 05:56:42,659 INFO L130 PetriNetUnfolder]: 1082/4295 cut-off events. [2022-12-06 05:56:42,659 INFO L131 PetriNetUnfolder]: For 662611/662996 co-relation queries the response was YES. [2022-12-06 05:56:42,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73417 conditions, 4295 events. 1082/4295 cut-off events. For 662611/662996 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 51039 event pairs, 97 based on Foata normal form. 41/4297 useless extension candidates. Maximal degree in co-relation 72939. Up to 1382 conditions per place. [2022-12-06 05:56:42,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 514 places, 1049 transitions, 39742 flow [2022-12-06 05:56:42,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 2640 [2022-12-06 05:56:43,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_276| v_~f~0.base_186))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_186 (* v_~x1~0_335 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_186 (* v_~x2~0_258 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_186 (* .cse2 4)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_256| 4294967295) 4294967296) .cse0) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_196|) |v_thread2Thread1of1ForFork1_~i~1#1_195|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_194)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_335 v_~size~0_194) (<= 0 v_~x1~0_335)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_256| (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= v_~x1~0_334 (select .cse3 (+ v_~f~0.offset_186 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188| 0)) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_194)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_186 (* .cse1 4))) v_~x2~0_257) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_196| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, #memory_int=|v_#memory_int_276|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_196|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_335, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_257, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_190|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_126|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_195|, ~x1~0=v_~x1~0_334, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_256|, #memory_int=|v_#memory_int_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_116|, ~n~0=v_~n~0_193, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_116|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:56:44,126 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:56:44,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2912 [2022-12-06 05:56:44,126 INFO L495 AbstractCegarLoop]: Abstraction has has 513 places, 1048 transitions, 39870 flow [2022-12-06 05:56:44,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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 05:56:44,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:56:44,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:56:44,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-06 05:56:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-06 05:56:44,332 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:56:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:56:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1326402665, now seen corresponding path program 1 times [2022-12-06 05:56:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:56:44,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000791691] [2022-12-06 05:56:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:56:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:56:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000791691] [2022-12-06 05:56:44,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000791691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:56:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969394734] [2022-12-06 05:56:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:56:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:56:44,397 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:56:44,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 05:56:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:44,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:56:44,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:56:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:44,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:56:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:44,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969394734] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:56:44,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:56:44,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:56:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101081414] [2022-12-06 05:56:44,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:56:44,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:56:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:56:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:56:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:56:44,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 105 [2022-12-06 05:56:44,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 1048 transitions, 39870 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:56:44,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:56:44,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 105 [2022-12-06 05:56:44,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:56:46,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:47,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:51,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:54,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:56,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:57:02,057 INFO L130 PetriNetUnfolder]: 4436/9725 cut-off events. [2022-12-06 05:57:02,057 INFO L131 PetriNetUnfolder]: For 1559134/1559134 co-relation queries the response was YES. [2022-12-06 05:57:02,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176183 conditions, 9725 events. 4436/9725 cut-off events. For 1559134/1559134 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 93196 event pairs, 666 based on Foata normal form. 144/9867 useless extension candidates. Maximal degree in co-relation 175519. Up to 3667 conditions per place. [2022-12-06 05:57:02,215 INFO L137 encePairwiseOnDemand]: 51/105 looper letters, 792 selfloop transitions, 434 changer transitions 17/1243 dead transitions. [2022-12-06 05:57:02,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 1243 transitions, 50485 flow [2022-12-06 05:57:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:57:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:57:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-12-06 05:57:02,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12673992673992673 [2022-12-06 05:57:02,216 INFO L175 Difference]: Start difference. First operand has 513 places, 1048 transitions, 39870 flow. Second operand 13 states and 173 transitions. [2022-12-06 05:57:02,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 1243 transitions, 50485 flow [2022-12-06 05:57:09,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 1243 transitions, 49427 flow, removed 476 selfloop flow, removed 6 redundant places. [2022-12-06 05:57:09,963 INFO L231 Difference]: Finished difference. Result has 525 places, 1144 transitions, 45116 flow [2022-12-06 05:57:09,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=38544, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=334, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=45116, PETRI_PLACES=525, PETRI_TRANSITIONS=1144} [2022-12-06 05:57:09,964 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 504 predicate places. [2022-12-06 05:57:09,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:57:09,964 INFO L89 Accepts]: Start accepts. Operand has 525 places, 1144 transitions, 45116 flow [2022-12-06 05:57:09,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:57:09,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:57:09,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 525 places, 1144 transitions, 45116 flow [2022-12-06 05:57:09,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 522 places, 1144 transitions, 45116 flow [2022-12-06 05:57:11,556 INFO L130 PetriNetUnfolder]: 1180/4626 cut-off events. [2022-12-06 05:57:11,556 INFO L131 PetriNetUnfolder]: For 809206/809499 co-relation queries the response was YES. [2022-12-06 05:57:11,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83588 conditions, 4626 events. 1180/4626 cut-off events. For 809206/809499 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 55340 event pairs, 86 based on Foata normal form. 42/4636 useless extension candidates. Maximal degree in co-relation 83066. Up to 1554 conditions per place. [2022-12-06 05:57:11,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 522 places, 1144 transitions, 45116 flow [2022-12-06 05:57:11,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 2794 [2022-12-06 05:57:11,670 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:57:11,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1707 [2022-12-06 05:57:11,671 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 1144 transitions, 45116 flow [2022-12-06 05:57:11,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 05:57:11,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:57:11,671 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:57:11,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 05:57:11,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:57:11,873 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:57:11,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:57:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1267278371, now seen corresponding path program 4 times [2022-12-06 05:57:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:57:11,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622220470] [2022-12-06 05:57:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:57:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:57:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:57:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:57:11,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622220470] [2022-12-06 05:57:11,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622220470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:57:11,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917759393] [2022-12-06 05:57:11,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 05:57:11,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:57:11,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:57:11,936 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:57:11,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 05:57:12,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 05:57:12,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:57:12,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:57:12,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:57:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:57:12,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:57:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:57:14,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917759393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:57:14,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:57:14,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-12-06 05:57:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673972115] [2022-12-06 05:57:14,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:57:14,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:57:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:57:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:57:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2022-12-06 05:57:14,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 104 [2022-12-06 05:57:14,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 1144 transitions, 45116 flow. Second operand has 9 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 05:57:14,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:57:14,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 104 [2022-12-06 05:57:14,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:57:18,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:20,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:22,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:24,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:26,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:28,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:31,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:33,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:35,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:38,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:41,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:43,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:45,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:47,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:49,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:52,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:54,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:56,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:58,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:00,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:02,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:04,284 WARN L837 $PredicateComparison]: unable to prove that (and (<= (+ (* (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) (* 2 c_~n~0)) (+ |c_thread2Thread1of1ForFork1_~i~1#1| (* (div c_~n~0 2147483648) 4294967296))) (forall ((aux_mod_aux_mod_~n~0_21_42 Int) (aux_div_aux_mod_~n~0_21_42 Int)) (or (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* 2 (mod (+ 2 (* 2147483647 aux_mod_aux_mod_~n~0_21_42)) 2147483648))) (<= 0 aux_div_aux_mod_~n~0_21_42) (>= aux_mod_aux_mod_~n~0_21_42 2147483648) (<= (+ (* 2147483648 aux_div_aux_mod_~n~0_21_42) aux_mod_aux_mod_~n~0_21_42 2147483646) 0)))) is different from false [2022-12-06 05:58:06,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:09,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:11,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:13,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:15,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:17,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:19,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:22,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:58:30,326 INFO L130 PetriNetUnfolder]: 4406/9670 cut-off events. [2022-12-06 05:58:30,326 INFO L131 PetriNetUnfolder]: For 1660552/1660552 co-relation queries the response was YES. [2022-12-06 05:58:30,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179884 conditions, 9670 events. 4406/9670 cut-off events. For 1660552/1660552 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 92405 event pairs, 640 based on Foata normal form. 16/9684 useless extension candidates. Maximal degree in co-relation 179415. Up to 8833 conditions per place. [2022-12-06 05:58:30,480 INFO L137 encePairwiseOnDemand]: 33/104 looper letters, 970 selfloop transitions, 215 changer transitions 19/1204 dead transitions. [2022-12-06 05:58:30,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 1204 transitions, 49102 flow [2022-12-06 05:58:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:58:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:58:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2022-12-06 05:58:30,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1242603550295858 [2022-12-06 05:58:30,482 INFO L175 Difference]: Start difference. First operand has 522 places, 1144 transitions, 45116 flow. Second operand 13 states and 168 transitions. [2022-12-06 05:58:30,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 1204 transitions, 49102 flow Received shutdown request... [2022-12-06 05:58:32,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:58:32,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-06 05:58:32,662 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:58:32,662 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:58:32,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:58:32,850 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 05:58:32,858 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:58:32,858 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:58:32,859 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:58:32,861 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:58:32,861 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:58:32,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:58:32 BasicIcfg [2022-12-06 05:58:32,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:58:32,864 INFO L158 Benchmark]: Toolchain (without parser) took 841597.06ms. Allocated memory was 220.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 196.5MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 05:58:32,864 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 196.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:58:32,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.02ms. Allocated memory is still 220.2MB. Free memory was 196.0MB in the beginning and 185.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:58:32,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.90ms. Allocated memory is still 220.2MB. Free memory was 185.0MB in the beginning and 182.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:58:32,869 INFO L158 Benchmark]: Boogie Preprocessor took 31.99ms. Allocated memory is still 220.2MB. Free memory was 182.9MB in the beginning and 181.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:58:32,869 INFO L158 Benchmark]: RCFGBuilder took 330.77ms. Allocated memory is still 220.2MB. Free memory was 181.3MB in the beginning and 165.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 05:58:32,869 INFO L158 Benchmark]: TraceAbstraction took 840954.62ms. Allocated memory was 220.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 164.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 05:58:32,869 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 196.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.02ms. Allocated memory is still 220.2MB. Free memory was 196.0MB in the beginning and 185.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.90ms. Allocated memory is still 220.2MB. Free memory was 185.0MB in the beginning and 182.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.99ms. Allocated memory is still 220.2MB. Free memory was 182.9MB in the beginning and 181.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 330.77ms. Allocated memory is still 220.2MB. Free memory was 181.3MB in the beginning and 165.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 840954.62ms. Allocated memory was 220.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 164.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 137 PlacesBefore, 21 PlacesAfterwards, 144 TransitionsBefore, 17 TransitionsAfterwards, 1942 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 47 ConcurrentYvCompositions, 11 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 1248, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 0, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2121, Positive conditional cache size: 0, Positive unconditional cache size: 2121, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 36 PlacesBefore, 34 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 46 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 53, Positive conditional cache size: 31, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 48 PlacesBefore, 48 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 57, Positive conditional cache size: 35, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 49 PlacesBefore, 49 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 59, Positive conditional cache size: 37, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 51 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 39, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 39, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 58 PlacesBefore, 58 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 67 PlacesBefore, 67 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 66, Positive conditional cache size: 43, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 78 PlacesBefore, 78 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 71, Positive conditional cache size: 48, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 71, Positive conditional cache size: 48, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 88 PlacesBefore, 88 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 72, Positive conditional cache size: 49, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 94 PlacesBefore, 95 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 77, Positive conditional cache size: 53, Positive unconditional cache size: 24, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 110 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 129 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 91, Positive conditional cache size: 66, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 108 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 94, Positive conditional cache size: 69, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 94, Positive conditional cache size: 69, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 108 PlacesBefore, 109 PlacesAfterwards, 131 TransitionsBefore, 132 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 102, Positive conditional cache size: 77, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 102, Positive conditional cache size: 77, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 119 PlacesBefore, 120 PlacesAfterwards, 139 TransitionsBefore, 140 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 105, Positive conditional cache size: 80, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 123 PlacesBefore, 122 PlacesAfterwards, 151 TransitionsBefore, 150 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 106, Positive conditional cache size: 81, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 135 PlacesBefore, 135 PlacesAfterwards, 161 TransitionsBefore, 161 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 212, Positive conditional cache size: 183, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 140 PlacesBefore, 141 PlacesAfterwards, 166 TransitionsBefore, 167 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 215, Positive conditional cache size: 186, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 151 PlacesBefore, 150 PlacesAfterwards, 175 TransitionsBefore, 174 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 149 PlacesBefore, 149 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 176 PlacesBefore, 175 PlacesAfterwards, 225 TransitionsBefore, 224 TransitionsAfterwards, 718 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 255, Positive conditional cache size: 225, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 179 PlacesBefore, 179 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 256, Positive conditional cache size: 226, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 179 PlacesBefore, 179 PlacesAfterwards, 232 TransitionsBefore, 232 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 256, Positive conditional cache size: 226, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 182 PlacesBefore, 182 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 256, Positive conditional cache size: 226, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 204 PlacesBefore, 204 PlacesAfterwards, 283 TransitionsBefore, 283 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 256, Positive conditional cache size: 226, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 203 PlacesBefore, 203 PlacesAfterwards, 293 TransitionsBefore, 294 TransitionsAfterwards, 856 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 260, Positive conditional cache size: 230, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 211 PlacesBefore, 210 PlacesAfterwards, 301 TransitionsBefore, 300 TransitionsAfterwards, 868 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 260, Positive conditional cache size: 230, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 213 PlacesBefore, 213 PlacesAfterwards, 301 TransitionsBefore, 301 TransitionsAfterwards, 868 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 260, Positive conditional cache size: 230, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 214 PlacesBefore, 214 PlacesAfterwards, 300 TransitionsBefore, 300 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 261, Positive conditional cache size: 231, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 222 PlacesBefore, 223 PlacesAfterwards, 306 TransitionsBefore, 327 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 285, Positive conditional cache size: 237, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 224 PlacesBefore, 223 PlacesAfterwards, 295 TransitionsBefore, 294 TransitionsAfterwards, 852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 289, Positive conditional cache size: 241, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 229 PlacesBefore, 228 PlacesAfterwards, 308 TransitionsBefore, 307 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 291, Positive conditional cache size: 243, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 225 PlacesBefore, 225 PlacesAfterwards, 305 TransitionsBefore, 305 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 292, Positive conditional cache size: 244, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 223 PlacesBefore, 223 PlacesAfterwards, 303 TransitionsBefore, 303 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 292, Positive conditional cache size: 244, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 224 PlacesBefore, 224 PlacesAfterwards, 304 TransitionsBefore, 304 TransitionsAfterwards, 852 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 292, Positive conditional cache size: 244, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 226 PlacesBefore, 226 PlacesAfterwards, 307 TransitionsBefore, 307 TransitionsAfterwards, 858 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 292, Positive conditional cache size: 244, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 238 PlacesBefore, 236 PlacesAfterwards, 321 TransitionsBefore, 319 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 294, Positive conditional cache size: 246, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 254 PlacesBefore, 254 PlacesAfterwards, 358 TransitionsBefore, 358 TransitionsAfterwards, 1010 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 332, Positive conditional cache size: 283, Positive unconditional cache size: 49, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 252 PlacesBefore, 252 PlacesAfterwards, 361 TransitionsBefore, 361 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 332, Positive conditional cache size: 283, Positive unconditional cache size: 49, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 263 PlacesBefore, 263 PlacesAfterwards, 412 TransitionsBefore, 412 TransitionsAfterwards, 1204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 332, Positive conditional cache size: 283, Positive unconditional cache size: 49, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 263 PlacesBefore, 263 PlacesAfterwards, 414 TransitionsBefore, 414 TransitionsAfterwards, 1202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 332, Positive conditional cache size: 283, Positive unconditional cache size: 49, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 273 PlacesBefore, 273 PlacesAfterwards, 424 TransitionsBefore, 424 TransitionsAfterwards, 1258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 333, Positive conditional cache size: 284, Positive unconditional cache size: 49, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 291 PlacesBefore, 290 PlacesAfterwards, 466 TransitionsBefore, 465 TransitionsAfterwards, 1382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 338, Positive conditional cache size: 288, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 303 PlacesBefore, 303 PlacesAfterwards, 478 TransitionsBefore, 478 TransitionsAfterwards, 1414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 340, Positive conditional cache size: 290, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 300 PlacesBefore, 299 PlacesAfterwards, 486 TransitionsBefore, 485 TransitionsAfterwards, 1420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 340, Positive conditional cache size: 290, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 313 PlacesBefore, 313 PlacesAfterwards, 522 TransitionsBefore, 522 TransitionsAfterwards, 1526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 340, Positive conditional cache size: 290, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 317 PlacesBefore, 317 PlacesAfterwards, 526 TransitionsBefore, 526 TransitionsAfterwards, 1538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 340, Positive conditional cache size: 290, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 331 PlacesBefore, 331 PlacesAfterwards, 539 TransitionsBefore, 539 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 340, Positive conditional cache size: 290, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 343 PlacesBefore, 343 PlacesAfterwards, 549 TransitionsBefore, 549 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 341, Positive conditional cache size: 291, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 381 PlacesBefore, 376 PlacesAfterwards, 680 TransitionsBefore, 675 TransitionsAfterwards, 1928 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 357, Positive conditional cache size: 306, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 378 PlacesBefore, 378 PlacesAfterwards, 672 TransitionsBefore, 672 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 357, Positive conditional cache size: 306, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 376 PlacesBefore, 376 PlacesAfterwards, 674 TransitionsBefore, 674 TransitionsAfterwards, 1892 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 357, Positive conditional cache size: 306, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 381 PlacesBefore, 381 PlacesAfterwards, 706 TransitionsBefore, 706 TransitionsAfterwards, 2014 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 357, Positive conditional cache size: 306, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 403 PlacesBefore, 403 PlacesAfterwards, 729 TransitionsBefore, 729 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 358, Positive conditional cache size: 307, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 408 PlacesBefore, 408 PlacesAfterwards, 734 TransitionsBefore, 734 TransitionsAfterwards, 2066 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 358, Positive conditional cache size: 307, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 456 PlacesBefore, 455 PlacesAfterwards, 917 TransitionsBefore, 916 TransitionsAfterwards, 2398 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 362, Positive conditional cache size: 311, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 460 PlacesBefore, 460 PlacesAfterwards, 915 TransitionsBefore, 915 TransitionsAfterwards, 2390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 363, Positive conditional cache size: 312, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 476 PlacesBefore, 476 PlacesAfterwards, 963 TransitionsBefore, 963 TransitionsAfterwards, 2424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 365, Positive conditional cache size: 314, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 490 PlacesBefore, 490 PlacesAfterwards, 984 TransitionsBefore, 984 TransitionsAfterwards, 2442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 366, Positive conditional cache size: 315, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 493 PlacesBefore, 493 PlacesAfterwards, 986 TransitionsBefore, 986 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 366, Positive conditional cache size: 315, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 514 PlacesBefore, 513 PlacesAfterwards, 1049 TransitionsBefore, 1048 TransitionsAfterwards, 2640 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 371, Positive conditional cache size: 320, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 522 PlacesBefore, 522 PlacesAfterwards, 1144 TransitionsBefore, 1144 TransitionsAfterwards, 2794 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 371, Positive conditional cache size: 320, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 189 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 840.8s, OverallIterations: 81, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 596.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 158 mSolverCounterUnknown, 2699 SdHoareTripleChecker+Valid, 238.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2699 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 233.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 183 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 3037 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28739 IncrementalHoareTripleChecker+Invalid, 32117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3037 mSolverCounterUnsat, 5 mSDtfsCounter, 28739 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1554 GetRequests, 882 SyntacticMatches, 38 SemanticMatches, 634 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 208.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45116occurred in iteration=80, InterpolantAutomatonStates: 624, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 146.2s InterpolantComputationTime, 1569 NumberOfCodeBlocks, 1569 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 1910 ConstructedInterpolants, 27 QuantifiedInterpolants, 43712 SizeOfPredicates, 288 NumberOfNonLiveVariables, 7129 ConjunctsInSsa, 782 ConjunctsInUnsatCore, 155 InterpolantComputations, 46 PerfectInterpolantSequences, 67/182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown