/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-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:44:31,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:44:31,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:44:31,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:44:31,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:44:31,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:44:31,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:44:31,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:44:31,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:44:31,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:44:31,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:44:31,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:44:31,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:44:31,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:44:31,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:44:31,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:44:31,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:44:31,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:44:31,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:44:31,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:44:31,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:44:31,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:44:31,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:44:31,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:44:31,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:44:31,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:44:31,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:44:31,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:44:31,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:44:31,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:44:31,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:44:31,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:44:31,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:44:31,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:44:31,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:44:31,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:44:31,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:44:31,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:44:31,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:44:31,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:44:31,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:44:31,579 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:31,603 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:44:31,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:44:31,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:44:31,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:44:31,605 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:44:31,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:44:31,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:44:31,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:44:31,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:44:31,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:44:31,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:44:31,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:44:31,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:44:31,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:31,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:44:31,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:44:31,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:44:31,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:44:31,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:44:31,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:44:31,608 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:31,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:44:31,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:44:31,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:44:31,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:44:31,913 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:44:31,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-06 05:44:33,045 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:44:33,251 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:44:33,251 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-06 05:44:33,258 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a47a50ed/25668992e37b4d75a776da28d99093ed/FLAG96520210c [2022-12-06 05:44:33,280 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a47a50ed/25668992e37b4d75a776da28d99093ed [2022-12-06 05:44:33,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:44:33,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:44:33,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:33,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:44:33,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:44:33,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:33" (1/1) ... [2022-12-06 05:44:33,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37077c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:33, skipping insertion in model container [2022-12-06 05:44:33,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:33" (1/1) ... [2022-12-06 05:44:33,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:44:33,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:44:33,493 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-3.wvr.c[2500,2513] [2022-12-06 05:44:33,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:33,517 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:44:33,558 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-3.wvr.c[2500,2513] [2022-12-06 05:44:33,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:33,570 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:44:33,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:33 WrapperNode [2022-12-06 05:44:33,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:33,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:33,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:44:33,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:44:33,577 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:33" (1/1) ... [2022-12-06 05:44:33,582 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:33" (1/1) ... [2022-12-06 05:44:33,608 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-06 05:44:33,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:33,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:44:33,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:44:33,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:44:33,617 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:33" (1/1) ... [2022-12-06 05:44:33,617 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:33" (1/1) ... [2022-12-06 05:44:33,620 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:33" (1/1) ... [2022-12-06 05:44:33,620 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:33" (1/1) ... [2022-12-06 05:44:33,624 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:33" (1/1) ... [2022-12-06 05:44:33,628 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:33" (1/1) ... [2022-12-06 05:44:33,629 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:33" (1/1) ... [2022-12-06 05:44:33,630 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:33" (1/1) ... [2022-12-06 05:44:33,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:44:33,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:44:33,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:44:33,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:44:33,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:33" (1/1) ... [2022-12-06 05:44:33,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:33,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:33,682 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:33,728 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:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:44:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:44:33,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:44:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:44:33,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:44:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:44:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:44:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:44:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:44:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:44:33,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:44:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:44:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:44:33,766 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:33,855 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:44:33,857 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:44:34,050 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:44:34,056 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:44:34,057 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:44:34,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:34 BoogieIcfgContainer [2022-12-06 05:44:34,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:44:34,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:44:34,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:44:34,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:44:34,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:44:33" (1/3) ... [2022-12-06 05:44:34,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e451f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:34, skipping insertion in model container [2022-12-06 05:44:34,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:33" (2/3) ... [2022-12-06 05:44:34,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e451f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:34, skipping insertion in model container [2022-12-06 05:44:34,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:34" (3/3) ... [2022-12-06 05:44:34,064 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2022-12-06 05:44:34,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:44:34,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:44:34,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:44:34,212 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:44:34,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 167 transitions, 350 flow [2022-12-06 05:44:34,297 INFO L130 PetriNetUnfolder]: 15/165 cut-off events. [2022-12-06 05:44:34,297 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:34,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 15/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 165 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 05:44:34,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 167 transitions, 350 flow [2022-12-06 05:44:34,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 157 transitions, 326 flow [2022-12-06 05:44:34,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:34,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-06 05:44:34,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 157 transitions, 326 flow [2022-12-06 05:44:34,351 INFO L130 PetriNetUnfolder]: 15/157 cut-off events. [2022-12-06 05:44:34,351 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:34,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 15/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 146 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 05:44:34,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-06 05:44:34,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 2592 [2022-12-06 05:44:39,361 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 05:44:39,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:44:39,389 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;@29a402b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:44:39,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:44:39,396 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:44:39,396 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:39,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:39,397 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,397 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:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1887355417, now seen corresponding path program 1 times [2022-12-06 05:44:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:39,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480690818] [2022-12-06 05:44:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:39,676 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,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:39,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480690818] [2022-12-06 05:44:39,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480690818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:39,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:39,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:44:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909786062] [2022-12-06 05:44:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:39,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:39,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:39,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:44:39,705 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:39,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:39,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:44:39,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:39,763 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-06 05:44:39,763 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:44:39,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 19 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-06 05:44:39,766 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 05:44:39,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 05:44:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 05:44:39,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 05:44:39,777 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:39,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 05:44:39,780 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:39,781 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:39,782 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:39,786 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:44:39,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:39,787 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:39,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:39,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:39,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:39,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:39,796 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:44:39,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:44:39,797 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 3. Compared 11 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:39,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:39,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:44:40,436 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:40,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 651 [2022-12-06 05:44:40,437 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 05:44:40,437 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:40,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:40,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:40,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:44:40,438 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:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1661137616, now seen corresponding path program 1 times [2022-12-06 05:44:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:40,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323305603] [2022-12-06 05:44:40,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:40,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323305603] [2022-12-06 05:44:40,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323305603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:40,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:40,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:44:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856976321] [2022-12-06 05:44:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:40,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:40,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:40,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:44:40,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 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:40,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:40,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:44:40,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:40,685 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 05:44:40,686 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:40,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 320 event pairs, 9 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 05:44:40,690 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 05:44:40,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 05:44:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:44:40,692 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 05:44:40,692 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:40,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 05:44:40,693 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:40,693 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:40,693 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:40,694 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:44:40,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:40,694 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:40,695 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:40,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:40,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:40,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:40,719 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 05:44:40,719 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:44:40,721 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 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 05:44:40,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:40,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 05:44:40,722 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:40,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:44:40,724 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:40,724 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:40,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:40,724 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:40,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:44:40,724 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:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005448, now seen corresponding path program 1 times [2022-12-06 05:44:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:40,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663187410] [2022-12-06 05:44:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:40,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:40,885 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:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:40,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663187410] [2022-12-06 05:44:40,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663187410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:40,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:40,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170334101] [2022-12-06 05:44:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:40,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:40,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:40,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:44:40,890 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:40,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:40,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:44:40,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:40,995 INFO L130 PetriNetUnfolder]: 85/169 cut-off events. [2022-12-06 05:44:40,995 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 05:44:40,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 169 events. 85/169 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 578 event pairs, 26 based on Foata normal form. 12/180 useless extension candidates. Maximal degree in co-relation 140. Up to 86 conditions per place. [2022-12-06 05:44:40,996 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 8/42 dead transitions. [2022-12-06 05:44:40,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 202 flow [2022-12-06 05:44:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 05:44:40,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 05:44:40,998 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 41 transitions. [2022-12-06 05:44:40,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 202 flow [2022-12-06 05:44:40,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:40,999 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:40,999 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:40,999 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:44:40,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:40,999 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:41,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:41,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:41,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:41,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 05:44:41,004 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-06 05:44:41,004 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-06 05:44:41,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 38 events. 7/38 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-12-06 05:44:41,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 05:44:41,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:44:41,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:41,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:44:41,164 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 05:44:41,164 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:41,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:41,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:41,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:44:41,165 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:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1672318876, now seen corresponding path program 1 times [2022-12-06 05:44:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:41,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215361230] [2022-12-06 05:44:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:41,268 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:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:41,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215361230] [2022-12-06 05:44:41,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215361230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:41,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:41,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459512401] [2022-12-06 05:44:41,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:41,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:41,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:41,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:41,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:41,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 05:44:41,270 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:41,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:41,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 05:44:41,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:41,310 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-06 05:44:41,311 INFO L131 PetriNetUnfolder]: For 152/165 co-relation queries the response was YES. [2022-12-06 05:44:41,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 111 events. 59/111 cut-off events. For 152/165 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 326 event pairs, 14 based on Foata normal form. 7/116 useless extension candidates. Maximal degree in co-relation 287. Up to 76 conditions per place. [2022-12-06 05:44:41,312 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 20 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2022-12-06 05:44:41,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-06 05:44:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:44:41,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 05:44:41,312 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:41,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-06 05:44:41,316 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:41,316 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-06 05:44:41,317 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:41,317 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 05:44:41,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:41,317 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-06 05:44:41,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:41,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:41,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-06 05:44:41,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-06 05:44:41,333 INFO L130 PetriNetUnfolder]: 7/25 cut-off events. [2022-12-06 05:44:41,333 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:41,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 25 events. 7/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-06 05:44:41,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-06 05:44:41,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 05:44:41,334 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:41,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:44:41,334 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-06 05:44:41,334 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:41,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:41,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:41,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:44:41,335 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:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash 526664714, now seen corresponding path program 1 times [2022-12-06 05:44:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:41,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819618035] [2022-12-06 05:44:41,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:41,418 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:41,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819618035] [2022-12-06 05:44:41,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819618035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:41,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:41,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:41,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373960435] [2022-12-06 05:44:41,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:41,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:44:41,420 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:41,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:41,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:44:41,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:41,493 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-06 05:44:41,493 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 05:44:41,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 111 events. 59/111 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 20 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 204. Up to 76 conditions per place. [2022-12-06 05:44:41,494 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-06 05:44:41,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 175 flow [2022-12-06 05:44:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 05:44:41,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 05:44:41,510 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 34 transitions. [2022-12-06 05:44:41,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 175 flow [2022-12-06 05:44:41,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 160 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:41,511 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:41,511 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:41,512 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 05:44:41,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:41,512 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:41,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:41,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:41,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:41,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:41,519 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 05:44:41,519 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:44:41,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 40. Up to 9 conditions per place. [2022-12-06 05:44:41,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 05:44:41,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 05:44:41,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:41,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:44:41,712 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-06 05:44:41,712 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:41,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:41,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:41,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:44:41,712 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:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1844971348, now seen corresponding path program 1 times [2022-12-06 05:44:41,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:41,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664905917] [2022-12-06 05:44:41,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:41,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:41,752 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:41,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:41,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664905917] [2022-12-06 05:44:41,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664905917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:41,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:41,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:41,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612718082] [2022-12-06 05:44:41,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:41,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:41,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:41,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:41,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:44:41,754 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:41,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:41,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:44:41,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:41,792 INFO L130 PetriNetUnfolder]: 42/78 cut-off events. [2022-12-06 05:44:41,793 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 05:44:41,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 78 events. 42/78 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 149 event pairs, 9 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 82. Up to 68 conditions per place. [2022-12-06 05:44:41,793 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 1/23 dead transitions. [2022-12-06 05:44:41,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 134 flow [2022-12-06 05:44:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 05:44:41,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:44:41,794 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 24 transitions. [2022-12-06 05:44:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 134 flow [2022-12-06 05:44:41,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 117 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:41,795 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-06 05:44:41,795 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:41,796 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:44:41,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:41,796 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-06 05:44:41,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:41,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:41,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-06 05:44:41,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-06 05:44:41,799 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-06 05:44:41,799 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:44:41,799 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 24. Up to 9 conditions per place. [2022-12-06 05:44:41,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-06 05:44:41,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:44:41,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:41,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 05:44:41,801 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-06 05:44:41,801 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:41,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:41,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:41,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:44:41,801 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:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -854334181, now seen corresponding path program 1 times [2022-12-06 05:44:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:41,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350141336] [2022-12-06 05:44:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:41,921 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:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:41,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350141336] [2022-12-06 05:44:41,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350141336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:41,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:41,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:41,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856400697] [2022-12-06 05:44:41,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:41,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:41,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:41,922 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:41,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:41,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:41,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:42,016 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-06 05:44:42,016 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 05:44:42,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 94 events. 52/94 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 93. Up to 73 conditions per place. [2022-12-06 05:44:42,017 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2022-12-06 05:44:42,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 137 flow [2022-12-06 05:44:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 05:44:42,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-06 05:44:42,018 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 27 transitions. [2022-12-06 05:44:42,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 137 flow [2022-12-06 05:44:42,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 133 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:42,019 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 79 flow [2022-12-06 05:44:42,019 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-06 05:44:42,019 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 05:44:42,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:42,020 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 79 flow [2022-12-06 05:44:42,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:42,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:42,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-06 05:44:42,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 79 flow [2022-12-06 05:44:42,023 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-06 05:44:42,023 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:44:42,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 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 42 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-06 05:44:42,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-06 05:44:42,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 05:44:42,029 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:42,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:44:42,029 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 79 flow [2022-12-06 05:44:42,029 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:42,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:42,030 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:42,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:44:42,030 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:42,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash -503744373, now seen corresponding path program 1 times [2022-12-06 05:44:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:42,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687091096] [2022-12-06 05:44:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:42,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:42,334 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,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:42,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687091096] [2022-12-06 05:44:42,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687091096] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:42,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458028664] [2022-12-06 05:44:42,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:42,359 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:42,364 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:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:42,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:44:42,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:42,459 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:42,482 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:42,500 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:42,595 INFO L321 Elim1Store]: treesize reduction 29, result has 58.0 percent of original size [2022-12-06 05:44:42,595 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 77 treesize of output 66 [2022-12-06 05:44:42,637 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,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:45,261 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:45,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458028664] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:45,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:45,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 05:44:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441007116] [2022-12-06 05:44:45,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:45,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:44:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:45,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:44:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=191, Unknown=3, NotChecked=0, Total=240 [2022-12-06 05:44:45,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:45,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 79 flow. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:45,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:45,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:45,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:46,180 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2022-12-06 05:44:46,181 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 05:44:46,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 256 events. 143/256 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 822 event pairs, 14 based on Foata normal form. 9/265 useless extension candidates. Maximal degree in co-relation 136. Up to 123 conditions per place. [2022-12-06 05:44:46,182 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 50 selfloop transitions, 14 changer transitions 24/88 dead transitions. [2022-12-06 05:44:46,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 88 transitions, 488 flow [2022-12-06 05:44:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:44:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:44:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-12-06 05:44:46,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28173374613003094 [2022-12-06 05:44:46,184 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 79 flow. Second operand 17 states and 91 transitions. [2022-12-06 05:44:46,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 88 transitions, 488 flow [2022-12-06 05:44:46,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 88 transitions, 465 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:46,186 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 156 flow [2022-12-06 05:44:46,186 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=156, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 05:44:46,187 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 05:44:46,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:46,187 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 156 flow [2022-12-06 05:44:46,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:46,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:46,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 156 flow [2022-12-06 05:44:46,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 156 flow [2022-12-06 05:44:46,197 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2022-12-06 05:44:46,197 INFO L131 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2022-12-06 05:44:46,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 48 events. 12/48 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 109 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 120. Up to 22 conditions per place. [2022-12-06 05:44:46,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 156 flow [2022-12-06 05:44:46,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:44:48,351 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:48,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2165 [2022-12-06 05:44:48,352 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 156 flow [2022-12-06 05:44:48,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:48,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:48,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:44:48,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:48,553 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:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1982835261, now seen corresponding path program 1 times [2022-12-06 05:44:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:48,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676829141] [2022-12-06 05:44:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:48,790 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,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:48,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676829141] [2022-12-06 05:44:48,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676829141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:48,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:48,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447738304] [2022-12-06 05:44:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:48,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:48,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:48,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:48,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:44:48,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 2.6) 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:48,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:48,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:44:48,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:48,912 INFO L130 PetriNetUnfolder]: 99/187 cut-off events. [2022-12-06 05:44:48,912 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 05:44:48,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 187 events. 99/187 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 547 event pairs, 51 based on Foata normal form. 8/193 useless extension candidates. Maximal degree in co-relation 672. Up to 169 conditions per place. [2022-12-06 05:44:48,913 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-06 05:44:48,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 256 flow [2022-12-06 05:44:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 05:44:48,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-06 05:44:48,914 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 156 flow. Second operand 4 states and 30 transitions. [2022-12-06 05:44:48,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 256 flow [2022-12-06 05:44:48,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 225 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:48,917 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 146 flow [2022-12-06 05:44:48,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-06 05:44:48,918 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 05:44:48,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:48,918 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 146 flow [2022-12-06 05:44:48,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:48,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:48,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 146 flow [2022-12-06 05:44:48,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 146 flow [2022-12-06 05:44:48,925 INFO L130 PetriNetUnfolder]: 13/50 cut-off events. [2022-12-06 05:44:48,925 INFO L131 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2022-12-06 05:44:48,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 50 events. 13/50 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 123. Up to 24 conditions per place. [2022-12-06 05:44:48,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 146 flow [2022-12-06 05:44:48,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:44:48,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] L101-6-->L85-2: Formula: (and (= |v_#pthreadsForks_55| (+ |v_#pthreadsForks_56| 1)) (= v_~f~0.offset_85 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~f~0.base_85) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| (ite (< (mod v_~n~0_68 4294967296) 1431655765) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_133| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_main_#t~pre12#1_43| |v_#pthreadsForks_56|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_133|) (= (store |v_#memory_int_124| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_124| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_43|)) |v_#memory_int_123|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~n~0=v_~n~0_68, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ~f~0.base=v_~f~0.base_85, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~f~0.offset=v_~f~0.offset_85, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_133|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_31|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_31|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ~n~0=v_~n~0_68, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~f~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~f~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [656] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_182| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_121 (* v_~x1~0_121 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_73| 2) (= (ite (and (< .cse0 v_~size~0_125) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= v_~x1~0_119 (select .cse1 (+ v_~f~0.offset_121 (* 4 .cse0)))) (not (= (ite (and (<= 0 v_~x1~0_121) (< v_~x1~0_121 v_~size~0_125)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_107) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0))))) InVars {~size~0=v_~size~0_125, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_182|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_121, ~f~0.offset=v_~f~0.offset_121} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~size~0=v_~size~0_125, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_73|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, ~n~0=v_~n~0_107, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_53|, ~x1~0=v_~x1~0_119, ~f~0.offset=v_~f~0.offset_121} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:44:49,389 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:44:49,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 472 [2022-12-06 05:44:49,390 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 140 flow [2022-12-06 05:44:49,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:49,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:49,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:44:49,390 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:49,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1626137748, now seen corresponding path program 1 times [2022-12-06 05:44:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:49,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051507101] [2022-12-06 05:44:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:49,784 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,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:49,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051507101] [2022-12-06 05:44:49,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051507101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:49,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:49,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836062881] [2022-12-06 05:44:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:49,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:49,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:44:49,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 140 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,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:49,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:44:49,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:49,951 INFO L130 PetriNetUnfolder]: 126/236 cut-off events. [2022-12-06 05:44:49,952 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2022-12-06 05:44:49,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 236 events. 126/236 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 775 event pairs, 38 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 842. Up to 108 conditions per place. [2022-12-06 05:44:49,953 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 37 selfloop transitions, 6 changer transitions 16/59 dead transitions. [2022-12-06 05:44:49,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 396 flow [2022-12-06 05:44:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 05:44:49,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 05:44:49,955 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 140 flow. Second operand 6 states and 56 transitions. [2022-12-06 05:44:49,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 396 flow [2022-12-06 05:44:49,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 364 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:49,958 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 159 flow [2022-12-06 05:44:49,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 05:44:49,959 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 05:44:49,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:49,959 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 159 flow [2022-12-06 05:44:49,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:49,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:49,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 159 flow [2022-12-06 05:44:49,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 159 flow [2022-12-06 05:44:49,968 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-06 05:44:49,968 INFO L131 PetriNetUnfolder]: For 77/79 co-relation queries the response was YES. [2022-12-06 05:44:49,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 62 events. 14/62 cut-off events. For 77/79 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 203 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 118. Up to 26 conditions per place. [2022-12-06 05:44:49,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 159 flow [2022-12-06 05:44:49,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:44:49,970 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:49,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:44:49,970 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 159 flow [2022-12-06 05:44:49,971 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:49,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:49,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:49,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:44:49,971 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:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1747909610, now seen corresponding path program 1 times [2022-12-06 05:44:49,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:49,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652137685] [2022-12-06 05:44:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:50,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:44:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652137685] [2022-12-06 05:44:50,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652137685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:50,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701052583] [2022-12-06 05:44:50,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:50,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:50,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:50,077 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:50,079 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:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:50,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:44:50,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:50,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:50,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:50,215 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,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701052583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:50,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:50,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 05:44:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159122126] [2022-12-06 05:44:50,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:50,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:44:50,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 159 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:44:50,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:50,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:44:50,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:50,428 INFO L130 PetriNetUnfolder]: 123/239 cut-off events. [2022-12-06 05:44:50,429 INFO L131 PetriNetUnfolder]: For 415/415 co-relation queries the response was YES. [2022-12-06 05:44:50,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 239 events. 123/239 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 811 event pairs, 56 based on Foata normal form. 6/244 useless extension candidates. Maximal degree in co-relation 576. Up to 120 conditions per place. [2022-12-06 05:44:50,430 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 39 selfloop transitions, 4 changer transitions 10/53 dead transitions. [2022-12-06 05:44:50,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 363 flow [2022-12-06 05:44:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 05:44:50,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 05:44:50,431 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 159 flow. Second operand 5 states and 50 transitions. [2022-12-06 05:44:50,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 363 flow [2022-12-06 05:44:50,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:50,432 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 170 flow [2022-12-06 05:44:50,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-06 05:44:50,433 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 05:44:50,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:50,433 INFO L89 Accepts]: Start accepts. Operand has 43 places, 29 transitions, 170 flow [2022-12-06 05:44:50,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:50,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:50,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 29 transitions, 170 flow [2022-12-06 05:44:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 170 flow [2022-12-06 05:44:50,439 INFO L130 PetriNetUnfolder]: 13/59 cut-off events. [2022-12-06 05:44:50,439 INFO L131 PetriNetUnfolder]: For 75/78 co-relation queries the response was YES. [2022-12-06 05:44:50,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 59 events. 13/59 cut-off events. For 75/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 130. Up to 25 conditions per place. [2022-12-06 05:44:50,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 170 flow [2022-12-06 05:44:50,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 05:44:50,909 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:50,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 477 [2022-12-06 05:44:50,910 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 158 flow [2022-12-06 05:44:50,910 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:44:50,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:50,910 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:50,930 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:51,111 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,SelfDestructingSolverStorable10 [2022-12-06 05:44:51,111 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:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 181150205, now seen corresponding path program 1 times [2022-12-06 05:44:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:51,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176685857] [2022-12-06 05:44:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:51,318 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:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176685857] [2022-12-06 05:44:51,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176685857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:51,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258473723] [2022-12-06 05:44:51,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:51,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:51,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:51,332 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:51,344 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:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:51,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:44:51,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:51,558 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:51,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:51,634 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:51,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258473723] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:51,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:51,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:44:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345547821] [2022-12-06 05:44:51,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:51,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:44:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:51,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:44:51,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:44:51,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:44:51,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 158 flow. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:51,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:51,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:44:51,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:52,397 INFO L130 PetriNetUnfolder]: 250/457 cut-off events. [2022-12-06 05:44:52,398 INFO L131 PetriNetUnfolder]: For 1091/1091 co-relation queries the response was YES. [2022-12-06 05:44:52,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 457 events. 250/457 cut-off events. For 1091/1091 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1848 event pairs, 26 based on Foata normal form. 54/509 useless extension candidates. Maximal degree in co-relation 1517. Up to 221 conditions per place. [2022-12-06 05:44:52,400 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 81 selfloop transitions, 25 changer transitions 8/114 dead transitions. [2022-12-06 05:44:52,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 114 transitions, 866 flow [2022-12-06 05:44:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:44:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:44:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 112 transitions. [2022-12-06 05:44:52,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 05:44:52,402 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 158 flow. Second operand 14 states and 112 transitions. [2022-12-06 05:44:52,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 114 transitions, 866 flow [2022-12-06 05:44:52,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 114 transitions, 772 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:52,406 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 379 flow [2022-12-06 05:44:52,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=379, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-12-06 05:44:52,406 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2022-12-06 05:44:52,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:52,406 INFO L89 Accepts]: Start accepts. Operand has 57 places, 44 transitions, 379 flow [2022-12-06 05:44:52,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:52,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:52,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 379 flow [2022-12-06 05:44:52,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 379 flow [2022-12-06 05:44:52,419 INFO L130 PetriNetUnfolder]: 38/132 cut-off events. [2022-12-06 05:44:52,419 INFO L131 PetriNetUnfolder]: For 280/288 co-relation queries the response was YES. [2022-12-06 05:44:52,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 132 events. 38/132 cut-off events. For 280/288 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 549 event pairs, 6 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 370. Up to 71 conditions per place. [2022-12-06 05:44:52,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 379 flow [2022-12-06 05:44:52,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:44:54,942 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:44:54,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2537 [2022-12-06 05:44:54,943 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 362 flow [2022-12-06 05:44:54,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:54,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:54,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:54,955 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:55,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:55,144 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:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1785931863, now seen corresponding path program 1 times [2022-12-06 05:44:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:55,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177333048] [2022-12-06 05:44:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:55,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:55,880 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,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:55,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177333048] [2022-12-06 05:44:55,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177333048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:55,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869204114] [2022-12-06 05:44:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:55,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:55,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:55,885 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:55,886 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:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:56,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 05:44:56,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:56,028 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 05:44:56,031 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:56,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:56,082 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 18 treesize of output 20 [2022-12-06 05:44:56,270 INFO L321 Elim1Store]: treesize reduction 65, result has 69.5 percent of original size [2022-12-06 05:44:56,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 149 treesize of output 195 [2022-12-06 05:44:59,922 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,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:00,004 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_276 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* 4 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4)))))) 4))) 4))) 4))))) (or (<= c_~size~0 .cse0) (= c_~x1~0 (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (< .cse0 0))))) is different from false [2022-12-06 05:45:00,389 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:00,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869204114] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:00,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:00,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 05:45:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161638991] [2022-12-06 05:45:00,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:00,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:45:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:00,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:45:00,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2022-12-06 05:45:00,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:45:00,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 362 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:00,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:00,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:45:00,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:00,690 INFO L130 PetriNetUnfolder]: 245/455 cut-off events. [2022-12-06 05:45:00,690 INFO L131 PetriNetUnfolder]: For 1483/1483 co-relation queries the response was YES. [2022-12-06 05:45:00,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 455 events. 245/455 cut-off events. For 1483/1483 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1781 event pairs, 73 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 1485. Up to 362 conditions per place. [2022-12-06 05:45:00,693 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 32 selfloop transitions, 5 changer transitions 21/58 dead transitions. [2022-12-06 05:45:00,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 557 flow [2022-12-06 05:45:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:45:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:45:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 05:45:00,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3565217391304348 [2022-12-06 05:45:00,695 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 362 flow. Second operand 5 states and 41 transitions. [2022-12-06 05:45:00,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 557 flow [2022-12-06 05:45:00,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 456 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:00,701 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 233 flow [2022-12-06 05:45:00,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-12-06 05:45:00,701 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 05:45:00,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:00,702 INFO L89 Accepts]: Start accepts. Operand has 58 places, 34 transitions, 233 flow [2022-12-06 05:45:00,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:00,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:00,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 34 transitions, 233 flow [2022-12-06 05:45:00,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 34 transitions, 233 flow [2022-12-06 05:45:00,714 INFO L130 PetriNetUnfolder]: 25/84 cut-off events. [2022-12-06 05:45:00,714 INFO L131 PetriNetUnfolder]: For 92/96 co-relation queries the response was YES. [2022-12-06 05:45:00,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 84 events. 25/84 cut-off events. For 92/96 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 277 event pairs, 4 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 235. Up to 47 conditions per place. [2022-12-06 05:45:00,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 34 transitions, 233 flow [2022-12-06 05:45:00,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 05:45:00,715 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:00,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:45:00,716 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 233 flow [2022-12-06 05:45:00,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:00,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:00,716 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:00,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:45:00,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:00,921 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:45:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1577182119, now seen corresponding path program 1 times [2022-12-06 05:45:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:00,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725248153] [2022-12-06 05:45:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:02,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725248153] [2022-12-06 05:45:02,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725248153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:02,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876027701] [2022-12-06 05:45:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:02,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:02,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:02,392 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:45:02,407 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:45:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:02,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 05:45:02,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:02,507 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 05:45:02,507 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 32 [2022-12-06 05:45:02,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:02,512 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 20 treesize of output 22 [2022-12-06 05:45:02,553 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:02,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:02,723 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 47 [2022-12-06 05:45:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:02,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876027701] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:03,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:45:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540433103] [2022-12-06 05:45:03,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:45:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:45:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=245, Unknown=2, NotChecked=0, Total=306 [2022-12-06 05:45:03,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:45:03,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 233 flow. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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:45:03,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:03,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:45:03,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:03,753 INFO L130 PetriNetUnfolder]: 419/774 cut-off events. [2022-12-06 05:45:03,754 INFO L131 PetriNetUnfolder]: For 1967/1967 co-relation queries the response was YES. [2022-12-06 05:45:03,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 774 events. 419/774 cut-off events. For 1967/1967 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3511 event pairs, 52 based on Foata normal form. 4/778 useless extension candidates. Maximal degree in co-relation 2808. Up to 371 conditions per place. [2022-12-06 05:45:03,758 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 90 selfloop transitions, 46 changer transitions 2/138 dead transitions. [2022-12-06 05:45:03,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 138 transitions, 1047 flow [2022-12-06 05:45:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:45:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:45:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-12-06 05:45:03,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2022-12-06 05:45:03,759 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 233 flow. Second operand 13 states and 112 transitions. [2022-12-06 05:45:03,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 138 transitions, 1047 flow [2022-12-06 05:45:03,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 138 transitions, 961 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-12-06 05:45:03,767 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 627 flow [2022-12-06 05:45:03,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=627, PETRI_PLACES=58, PETRI_TRANSITIONS=77} [2022-12-06 05:45:03,768 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 05:45:03,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:03,768 INFO L89 Accepts]: Start accepts. Operand has 58 places, 77 transitions, 627 flow [2022-12-06 05:45:03,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:03,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:03,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 77 transitions, 627 flow [2022-12-06 05:45:03,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 77 transitions, 627 flow [2022-12-06 05:45:03,787 INFO L130 PetriNetUnfolder]: 54/212 cut-off events. [2022-12-06 05:45:03,787 INFO L131 PetriNetUnfolder]: For 301/305 co-relation queries the response was YES. [2022-12-06 05:45:03,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 212 events. 54/212 cut-off events. For 301/305 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1095 event pairs, 4 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 582. Up to 104 conditions per place. [2022-12-06 05:45:03,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 77 transitions, 627 flow [2022-12-06 05:45:03,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 05:45:03,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:04,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:45:04,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_273| v_~f~0.base_173))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_169 (* v_~x1~0_227 4))))) (and (not (= (ite (and (< v_~x1~0_227 v_~size~0_173) (<= 0 v_~x1~0_227)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_161) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= |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)) (= (ite (and (< .cse0 v_~size~0_173) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= v_~x1~0_225 (select .cse1 (+ v_~f~0.offset_169 (* .cse0 4))))))) InVars {~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, #memory_int=|v_#memory_int_273|, ~n~0=v_~n~0_161, ~x1~0=v_~x1~0_227, ~f~0.offset=v_~f~0.offset_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, ~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_273|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, ~n~0=v_~n~0_161, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, ~x1~0=v_~x1~0_225, ~f~0.offset=v_~f~0.offset_169} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:04,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_273| v_~f~0.base_173))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_169 (* v_~x1~0_227 4))))) (and (not (= (ite (and (< v_~x1~0_227 v_~size~0_173) (<= 0 v_~x1~0_227)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_161) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= |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)) (= (ite (and (< .cse0 v_~size~0_173) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= v_~x1~0_225 (select .cse1 (+ v_~f~0.offset_169 (* .cse0 4))))))) InVars {~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, #memory_int=|v_#memory_int_273|, ~n~0=v_~n~0_161, ~x1~0=v_~x1~0_227, ~f~0.offset=v_~f~0.offset_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, ~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_273|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, ~n~0=v_~n~0_161, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, ~x1~0=v_~x1~0_225, ~f~0.offset=v_~f~0.offset_169} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:45:04,635 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:04,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 868 [2022-12-06 05:45:04,636 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 649 flow [2022-12-06 05:45:04,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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:45:04,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:04,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:04,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:04,837 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,SelfDestructingSolverStorable13 [2022-12-06 05:45:04,837 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:45:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:04,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1573603369, now seen corresponding path program 1 times [2022-12-06 05:45:04,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:04,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170876329] [2022-12-06 05:45:04,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:04,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:05,635 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:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:05,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170876329] [2022-12-06 05:45:05,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170876329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:05,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967730634] [2022-12-06 05:45:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:05,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:05,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:05,652 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:45:05,654 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:45:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:05,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 05:45:05,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:05,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:05,737 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:05,740 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:05,764 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:05,861 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 05:45:05,861 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 40 [2022-12-06 05:45:05,887 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:05,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:06,055 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:06,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967730634] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:06,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:06,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:45:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282548716] [2022-12-06 05:45:06,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:06,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:45:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:45:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=105, Unknown=1, NotChecked=0, Total=156 [2022-12-06 05:45:06,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:45:06,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 649 flow. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:06,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:06,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:45:06,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:08,506 INFO L130 PetriNetUnfolder]: 437/804 cut-off events. [2022-12-06 05:45:08,507 INFO L131 PetriNetUnfolder]: For 2243/2243 co-relation queries the response was YES. [2022-12-06 05:45:08,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 804 events. 437/804 cut-off events. For 2243/2243 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3562 event pairs, 218 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 2529. Up to 735 conditions per place. [2022-12-06 05:45:08,511 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 77 selfloop transitions, 23 changer transitions 2/102 dead transitions. [2022-12-06 05:45:08,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 977 flow [2022-12-06 05:45:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:45:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:45:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-12-06 05:45:08,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.285 [2022-12-06 05:45:08,512 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 649 flow. Second operand 8 states and 57 transitions. [2022-12-06 05:45:08,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 977 flow [2022-12-06 05:45:08,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 903 flow, removed 37 selfloop flow, removed 0 redundant places. [2022-12-06 05:45:08,517 INFO L231 Difference]: Finished difference. Result has 68 places, 84 transitions, 734 flow [2022-12-06 05:45:08,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=734, PETRI_PLACES=68, PETRI_TRANSITIONS=84} [2022-12-06 05:45:08,518 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-06 05:45:08,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:08,518 INFO L89 Accepts]: Start accepts. Operand has 68 places, 84 transitions, 734 flow [2022-12-06 05:45:08,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:08,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:08,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 84 transitions, 734 flow [2022-12-06 05:45:08,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 84 transitions, 734 flow [2022-12-06 05:45:08,536 INFO L130 PetriNetUnfolder]: 56/214 cut-off events. [2022-12-06 05:45:08,536 INFO L131 PetriNetUnfolder]: For 478/487 co-relation queries the response was YES. [2022-12-06 05:45:08,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 214 events. 56/214 cut-off events. For 478/487 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1053 event pairs, 1 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 710. Up to 68 conditions per place. [2022-12-06 05:45:08,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 84 transitions, 734 flow [2022-12-06 05:45:08,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:45:08,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:09,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [672] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_279| v_~f~0.base_177))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_173 (* v_~x2~0_197 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_173 (* .cse2 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_173 (* v_~x1~0_236 4))))) (and (= (select .cse0 (+ v_~f~0.offset_173 (* .cse1 4))) v_~x2~0_196) (< 1 (mod (* 3 v_~n~0_165) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_177)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (not (= (ite (and (< v_~x2~0_197 v_~size~0_177) (<= 0 v_~x2~0_197)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_236) (< v_~x1~0_236 v_~size~0_177)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_173 (* .cse3 4))) v_~x1~0_235) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|) (= (ite (and (< .cse3 v_~size~0_177) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_119|) (= |v_thread1Thread1of1ForFork0_~i~0#1_155| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116| 0)))))) InVars {~x2~0=v_~x2~0_197, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, #memory_int=|v_#memory_int_279|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_236, ~f~0.offset=v_~f~0.offset_173} OutVars{~x2~0=v_~x2~0_196, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_83|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_119|, ~x1~0=v_~x1~0_235, ~f~0.offset=v_~f~0.offset_173, 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_100|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_155|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, #memory_int=|v_#memory_int_279|, 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_165, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_59|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:09,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:09,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [676] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_290| v_~f~0.base_183))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_179 (* v_~x2~0_203 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_179 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_127| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_166| 1) (= v_~x2~0_202 (select .cse0 (+ v_~f~0.offset_179 (* 4 .cse1)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127| 0)) (= (ite (and (< .cse1 v_~size~0_183) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_127|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_183)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_124|) |v_thread2Thread1of1ForFork1_~i~1#1_123|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111| (ite (and (<= 0 v_~x1~0_254) (< v_~x1~0_254 v_~size~0_183)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_124| 4294967296) (mod (* 3 v_~n~0_171) 4294967296)) (not (= (ite (and (< v_~x2~0_203 v_~size~0_183) (<= 0 v_~x2~0_203)) 1 0) 0)) (= v_~x1~0_253 (select .cse0 (+ v_~f~0.offset_179 (* v_~x1~0_254 4)))))))) InVars {~x2~0=v_~x2~0_203, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_183, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_124|, ~n~0=v_~n~0_171, ~x1~0=v_~x1~0_254, ~f~0.offset=v_~f~0.offset_179} OutVars{~x2~0=v_~x2~0_202, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_119|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_87|, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_183, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_59|, 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_123|, ~x1~0=v_~x1~0_253, ~f~0.offset=v_~f~0.offset_179, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_51|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, #memory_int=|v_#memory_int_290|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_127|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_59|, ~n~0=v_~n~0_171, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_63|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_129|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:45:10,336 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [678] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_292| v_~f~0.base_185))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_181 (* v_~x1~0_259 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|) (= |v_thread1Thread1of1ForFork0_~i~0#1_168| 2) (= v_~x1~0_257 (select .cse0 (+ v_~f~0.offset_181 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x1~0_259) (< v_~x1~0_259 v_~size~0_185)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_173) 4294967296)) (= (ite (and (< .cse1 v_~size~0_185) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|)))) InVars {~size~0=v_~size~0_185, ~f~0.base=v_~f~0.base_185, #memory_int=|v_#memory_int_292|, ~n~0=v_~n~0_173, ~x1~0=v_~x1~0_259, ~f~0.offset=v_~f~0.offset_181} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, ~size~0=v_~size~0_185, ~f~0.base=v_~f~0.base_185, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_168|, #memory_int=|v_#memory_int_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|, ~n~0=v_~n~0_173, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_131|, ~x1~0=v_~x1~0_257, ~f~0.offset=v_~f~0.offset_181} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:10,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [673] $Ultimate##0-->L86-3: Formula: (let ((.cse1 (select |v_#memory_int_282| v_~f~0.base_179))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_175 (* v_~x1~0_240 4))))) (and (= |v_ULTIMATE.start_main_#t~pre14#1_97| |v_#pthreadsForks_155|) (= |v_thread1Thread1of1ForFork0_~i~0#1_157| 2) (= |v_#pthreadsForks_154| (+ |v_#pthreadsForks_155| 1)) (= (ite (and (< .cse0 v_~size~0_179) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (= v_~x1~0_239 (select .cse1 (+ v_~f~0.offset_175 (* .cse0 4)))) (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2~0#1.base_93| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2~0#1.base_93|) |v_ULTIMATE.start_main_~#t2~0#1.offset_89| |v_ULTIMATE.start_main_#t~pre14#1_97|)) |v_#memory_int_281|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118| 0)) (not (= (ite (and (<= 0 v_~x1~0_240) (< v_~x1~0_240 v_~size~0_179)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_167) 4294967296))))) InVars {#pthreadsForks=|v_#pthreadsForks_155|, ~size~0=v_~size~0_179, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_89|, ~f~0.base=v_~f~0.base_179, #memory_int=|v_#memory_int_282|, ~n~0=v_~n~0_167, ~x1~0=v_~x1~0_240, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_93|, ~f~0.offset=v_~f~0.offset_175} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~size~0=v_~size~0_179, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_89|, ~f~0.base=v_~f~0.base_179, ~x1~0=v_~x1~0_239, ~f~0.offset=v_~f~0.offset_175, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_110|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_97|, #pthreadsForks=|v_#pthreadsForks_154|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_281|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|, ~n~0=v_~n~0_167, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_120|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_93|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:10,693 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:45:10,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2176 [2022-12-06 05:45:10,694 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 84 transitions, 809 flow [2022-12-06 05:45:10,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:10,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:10,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:10,717 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:45:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:45:10,900 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:45:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1541117875, now seen corresponding path program 1 times [2022-12-06 05:45:10,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:10,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105848440] [2022-12-06 05:45:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:11,876 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:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:11,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105848440] [2022-12-06 05:45:11,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105848440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:11,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:11,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:45:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004858666] [2022-12-06 05:45:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:11,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:11,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:11,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:11,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:11,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:45:11,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 84 transitions, 809 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:45:11,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:11,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:45:11,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:12,139 INFO L130 PetriNetUnfolder]: 454/846 cut-off events. [2022-12-06 05:45:12,140 INFO L131 PetriNetUnfolder]: For 3003/3003 co-relation queries the response was YES. [2022-12-06 05:45:12,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 846 events. 454/846 cut-off events. For 3003/3003 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3841 event pairs, 193 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 3297. Up to 713 conditions per place. [2022-12-06 05:45:12,147 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 73 selfloop transitions, 27 changer transitions 4/104 dead transitions. [2022-12-06 05:45:12,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 1123 flow [2022-12-06 05:45:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:45:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:45:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 05:45:12,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 05:45:12,149 INFO L175 Difference]: Start difference. First operand has 68 places, 84 transitions, 809 flow. Second operand 5 states and 56 transitions. [2022-12-06 05:45:12,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 1123 flow [2022-12-06 05:45:12,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 104 transitions, 1047 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:12,161 INFO L231 Difference]: Finished difference. Result has 72 places, 86 transitions, 824 flow [2022-12-06 05:45:12,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=824, PETRI_PLACES=72, PETRI_TRANSITIONS=86} [2022-12-06 05:45:12,163 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-06 05:45:12,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:12,163 INFO L89 Accepts]: Start accepts. Operand has 72 places, 86 transitions, 824 flow [2022-12-06 05:45:12,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:12,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:12,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 86 transitions, 824 flow [2022-12-06 05:45:12,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 86 transitions, 824 flow [2022-12-06 05:45:12,193 INFO L130 PetriNetUnfolder]: 57/229 cut-off events. [2022-12-06 05:45:12,193 INFO L131 PetriNetUnfolder]: For 680/684 co-relation queries the response was YES. [2022-12-06 05:45:12,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 229 events. 57/229 cut-off events. For 680/684 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1186 event pairs, 1 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 846. Up to 74 conditions per place. [2022-12-06 05:45:12,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 86 transitions, 824 flow [2022-12-06 05:45:12,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 05:45:12,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:12,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:12,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-06 05:45:12,525 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 86 transitions, 846 flow [2022-12-06 05:45:12,525 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:45:12,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:12,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:12,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:45:12,527 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:45:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash 897559288, now seen corresponding path program 1 times [2022-12-06 05:45:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:12,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052706681] [2022-12-06 05:45:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:13,393 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:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:13,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052706681] [2022-12-06 05:45:13,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052706681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:13,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547142442] [2022-12-06 05:45:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:13,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:13,395 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:45:13,398 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:45:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:13,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:45:13,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:13,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:13,494 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 22 treesize of output 22 [2022-12-06 05:45:13,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:13,549 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 05:45:13,560 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:13,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:13,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:13,673 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 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-06 05:45:13,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:13,706 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-06 05:45:14,345 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:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547142442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:14,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:14,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:45:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916596268] [2022-12-06 05:45:14,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:14,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:45:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:14,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:45:14,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:45:14,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:45:14,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 86 transitions, 846 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:45:14,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:14,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:45:14,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:15,166 INFO L130 PetriNetUnfolder]: 520/959 cut-off events. [2022-12-06 05:45:15,167 INFO L131 PetriNetUnfolder]: For 3666/3666 co-relation queries the response was YES. [2022-12-06 05:45:15,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4223 conditions, 959 events. 520/959 cut-off events. For 3666/3666 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4611 event pairs, 205 based on Foata normal form. 1/956 useless extension candidates. Maximal degree in co-relation 4161. Up to 743 conditions per place. [2022-12-06 05:45:15,175 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 92 selfloop transitions, 43 changer transitions 4/139 dead transitions. [2022-12-06 05:45:15,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 139 transitions, 1429 flow [2022-12-06 05:45:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:45:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:45:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-12-06 05:45:15,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24147727272727273 [2022-12-06 05:45:15,176 INFO L175 Difference]: Start difference. First operand has 69 places, 86 transitions, 846 flow. Second operand 11 states and 85 transitions. [2022-12-06 05:45:15,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 139 transitions, 1429 flow [2022-12-06 05:45:15,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 139 transitions, 1357 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-06 05:45:15,188 INFO L231 Difference]: Finished difference. Result has 77 places, 102 transitions, 1071 flow [2022-12-06 05:45:15,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1071, PETRI_PLACES=77, PETRI_TRANSITIONS=102} [2022-12-06 05:45:15,188 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2022-12-06 05:45:15,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:15,188 INFO L89 Accepts]: Start accepts. Operand has 77 places, 102 transitions, 1071 flow [2022-12-06 05:45:15,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:15,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:15,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 102 transitions, 1071 flow [2022-12-06 05:45:15,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 102 transitions, 1071 flow [2022-12-06 05:45:15,224 INFO L130 PetriNetUnfolder]: 65/257 cut-off events. [2022-12-06 05:45:15,225 INFO L131 PetriNetUnfolder]: For 810/814 co-relation queries the response was YES. [2022-12-06 05:45:15,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 257 events. 65/257 cut-off events. For 810/814 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1450 event pairs, 1 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 901. Up to 89 conditions per place. [2022-12-06 05:45:15,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 102 transitions, 1071 flow [2022-12-06 05:45:15,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 05:45:15,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [687] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_302| v_~f~0.base_195))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_191 (* v_~x2~0_228 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_191 (* .cse0 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_191 (* 4 .cse1))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_191 (* .cse2 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_191 (* 4 .cse3))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141| 0)) (not (= (ite (and (< v_~x2~0_228 v_~size~0_195) (<= 0 v_~x2~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|) (not (= (ite (and (< .cse0 v_~size~0_195) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_195)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_195) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_195)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_180| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (= (ite (and (< v_~x1~0_278 v_~size~0_195) (<= 0 v_~x1~0_278)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|) (= (select .cse4 (+ v_~f~0.offset_191 (* .cse5 4))) v_~x2~0_226) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (and (< .cse5 v_~size~0_195) (<= 0 .cse5)) 1 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_139| 4294967293) 4294967296) (mod (* 3 v_~n~0_183) 4294967296)) (= v_~x1~0_277 (select .cse4 (+ v_~f~0.offset_191 (* v_~x1~0_278 4)))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_139|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141| 0))))))))) InVars {~x2~0=v_~x2~0_228, ~size~0=v_~size~0_195, ~f~0.base=v_~f~0.base_195, #memory_int=|v_#memory_int_302|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_278, ~f~0.offset=v_~f~0.offset_191} OutVars{~x2~0=v_~x2~0_226, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_133|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_101|, ~size~0=v_~size~0_195, ~f~0.base=v_~f~0.base_195, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_73|, 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_139|, ~x1~0=v_~x1~0_277, ~f~0.offset=v_~f~0.offset_191, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_65|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_180|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_63|, #memory_int=|v_#memory_int_302|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_73|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_77|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_143|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:16,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:16,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1269 [2022-12-06 05:45:16,457 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 1085 flow [2022-12-06 05:45:16,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:45:16,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:16,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:16,465 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:16,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:16,666 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:45:16,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -439053155, now seen corresponding path program 1 times [2022-12-06 05:45:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:16,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650294983] [2022-12-06 05:45:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:16,753 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:16,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:16,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650294983] [2022-12-06 05:45:16,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650294983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:16,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:16,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:16,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290848680] [2022-12-06 05:45:16,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:16,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:16,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:16,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:16,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:16,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:45:16,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 102 transitions, 1085 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:16,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:16,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:45:16,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:17,047 INFO L130 PetriNetUnfolder]: 572/1077 cut-off events. [2022-12-06 05:45:17,047 INFO L131 PetriNetUnfolder]: For 4936/4936 co-relation queries the response was YES. [2022-12-06 05:45:17,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1077 events. 572/1077 cut-off events. For 4936/4936 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5668 event pairs, 106 based on Foata normal form. 20/1097 useless extension candidates. Maximal degree in co-relation 4176. Up to 491 conditions per place. [2022-12-06 05:45:17,054 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 151 selfloop transitions, 15 changer transitions 7/173 dead transitions. [2022-12-06 05:45:17,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 173 transitions, 2069 flow [2022-12-06 05:45:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:45:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:45:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 05:45:17,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27310924369747897 [2022-12-06 05:45:17,055 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 1085 flow. Second operand 7 states and 65 transitions. [2022-12-06 05:45:17,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 173 transitions, 2069 flow [2022-12-06 05:45:17,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 173 transitions, 1978 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:17,066 INFO L231 Difference]: Finished difference. Result has 83 places, 113 transitions, 1199 flow [2022-12-06 05:45:17,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1199, PETRI_PLACES=83, PETRI_TRANSITIONS=113} [2022-12-06 05:45:17,066 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 05:45:17,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:17,066 INFO L89 Accepts]: Start accepts. Operand has 83 places, 113 transitions, 1199 flow [2022-12-06 05:45:17,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:17,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:17,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 113 transitions, 1199 flow [2022-12-06 05:45:17,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 113 transitions, 1199 flow [2022-12-06 05:45:17,092 INFO L130 PetriNetUnfolder]: 78/311 cut-off events. [2022-12-06 05:45:17,092 INFO L131 PetriNetUnfolder]: For 1545/1554 co-relation queries the response was YES. [2022-12-06 05:45:17,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 311 events. 78/311 cut-off events. For 1545/1554 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1928 event pairs, 1 based on Foata normal form. 2/310 useless extension candidates. Maximal degree in co-relation 1255. Up to 94 conditions per place. [2022-12-06 05:45:17,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 113 transitions, 1199 flow [2022-12-06 05:45:17,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 05:45:17,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 3 v_~n~0_In_6) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:45:17,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_285| v_~f~0.base_181))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_177 (* v_~x1~0_245 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_177 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120| 0)) (= v_~x1~0_243 (select .cse0 (+ v_~f~0.offset_177 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_159| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|) (not (= 0 (ite (and (< v_~x1~0_245 v_~size~0_181) (<= 0 v_~x1~0_245)) 1 0))) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (< 2 (mod (* 3 v_~n~0_169) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_181)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|))))) InVars {~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, #memory_int=|v_#memory_int_285|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_245, ~f~0.offset=v_~f~0.offset_177} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_159|, #memory_int=|v_#memory_int_285|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|, ~n~0=v_~n~0_169, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_122|, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_177} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:17,448 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:17,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-06 05:45:17,449 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 112 transitions, 1210 flow [2022-12-06 05:45:17,449 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:17,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:17,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:17,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:45:17,449 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:45:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:17,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1743020586, now seen corresponding path program 1 times [2022-12-06 05:45:17,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:17,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229059243] [2022-12-06 05:45:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:18,281 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:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:18,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229059243] [2022-12-06 05:45:18,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229059243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:18,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:18,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148665902] [2022-12-06 05:45:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:18,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:45:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:45:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:45:18,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:45:18,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 112 transitions, 1210 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:45:18,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:18,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:45:18,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:18,748 INFO L130 PetriNetUnfolder]: 570/1070 cut-off events. [2022-12-06 05:45:18,748 INFO L131 PetriNetUnfolder]: For 6868/6868 co-relation queries the response was YES. [2022-12-06 05:45:18,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 1070 events. 570/1070 cut-off events. For 6868/6868 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5451 event pairs, 228 based on Foata normal form. 1/1071 useless extension candidates. Maximal degree in co-relation 4704. Up to 908 conditions per place. [2022-12-06 05:45:18,757 INFO L137 encePairwiseOnDemand]: 13/35 looper letters, 92 selfloop transitions, 37 changer transitions 8/137 dead transitions. [2022-12-06 05:45:18,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1659 flow [2022-12-06 05:45:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 05:45:18,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2022-12-06 05:45:18,759 INFO L175 Difference]: Start difference. First operand has 81 places, 112 transitions, 1210 flow. Second operand 6 states and 62 transitions. [2022-12-06 05:45:18,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1659 flow [2022-12-06 05:45:18,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 1577 flow, removed 41 selfloop flow, removed 1 redundant places. [2022-12-06 05:45:18,792 INFO L231 Difference]: Finished difference. Result has 87 places, 116 transitions, 1342 flow [2022-12-06 05:45:18,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1342, PETRI_PLACES=87, PETRI_TRANSITIONS=116} [2022-12-06 05:45:18,793 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2022-12-06 05:45:18,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:18,793 INFO L89 Accepts]: Start accepts. Operand has 87 places, 116 transitions, 1342 flow [2022-12-06 05:45:18,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:18,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:18,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 116 transitions, 1342 flow [2022-12-06 05:45:18,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 116 transitions, 1342 flow [2022-12-06 05:45:18,820 INFO L130 PetriNetUnfolder]: 80/328 cut-off events. [2022-12-06 05:45:18,820 INFO L131 PetriNetUnfolder]: For 1485/1489 co-relation queries the response was YES. [2022-12-06 05:45:18,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 328 events. 80/328 cut-off events. For 1485/1489 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2080 event pairs, 1 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 1277. Up to 97 conditions per place. [2022-12-06 05:45:18,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 116 transitions, 1342 flow [2022-12-06 05:45:18,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 05:45:18,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [671] $Ultimate##0-->L86-3: Formula: (and (= (ite (and (<= 0 v_~x1~0_232) (< v_~x1~0_232 v_~size~0_175)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|) (= |v_ULTIMATE.start_main_#t~pre14#1_95| |v_#pthreadsForks_151|) (= v_~x1~0_231 (select (select |v_#memory_int_276| v_~f~0.base_175) (+ v_~f~0.offset_171 (* v_~x1~0_232 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_153| 4294967295) 4294967296) (mod (* 3 v_~n~0_163) 4294967296)) (= (+ |v_#pthreadsForks_151| 1) |v_#pthreadsForks_150|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_153| 1) (= (store |v_#memory_int_276| |v_ULTIMATE.start_main_~#t2~0#1.base_91| (store (select |v_#memory_int_276| |v_ULTIMATE.start_main_~#t2~0#1.base_91|) |v_ULTIMATE.start_main_~#t2~0#1.offset_87| |v_ULTIMATE.start_main_#t~pre14#1_95|)) |v_#memory_int_275|)) InVars {#pthreadsForks=|v_#pthreadsForks_151|, ~size~0=v_~size~0_175, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_87|, ~f~0.base=v_~f~0.base_175, #memory_int=|v_#memory_int_276|, ~n~0=v_~n~0_163, ~x1~0=v_~x1~0_232, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_91|, ~f~0.offset=v_~f~0.offset_171} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_106|, ~size~0=v_~size~0_175, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_87|, ~f~0.base=v_~f~0.base_175, ~x1~0=v_~x1~0_231, ~f~0.offset=v_~f~0.offset_171, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_95|, #pthreadsForks=|v_#pthreadsForks_150|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_153|, #memory_int=|v_#memory_int_275|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_78|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|, ~n~0=v_~n~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_91|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:18,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:18,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:45:18,978 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 116 transitions, 1351 flow [2022-12-06 05:45:18,978 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:45:18,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:18,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:45:18,978 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:45:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 609530576, now seen corresponding path program 1 times [2022-12-06 05:45:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:18,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280384619] [2022-12-06 05:45:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,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:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:19,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280384619] [2022-12-06 05:45:19,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280384619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:19,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257563971] [2022-12-06 05:45:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:19,053 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:19,092 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:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:45:19,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:19,169 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:19,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:19,221 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:19,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257563971] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:19,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:19,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:45:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139258941] [2022-12-06 05:45:19,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:19,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:45:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:45:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:45:19,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:45:19,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 116 transitions, 1351 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:45:19,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:19,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:45:19,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:20,087 INFO L130 PetriNetUnfolder]: 553/1055 cut-off events. [2022-12-06 05:45:20,088 INFO L131 PetriNetUnfolder]: For 5972/5972 co-relation queries the response was YES. [2022-12-06 05:45:20,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 1055 events. 553/1055 cut-off events. For 5972/5972 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5481 event pairs, 129 based on Foata normal form. 16/1071 useless extension candidates. Maximal degree in co-relation 4632. Up to 709 conditions per place. [2022-12-06 05:45:20,095 INFO L137 encePairwiseOnDemand]: 14/36 looper letters, 84 selfloop transitions, 65 changer transitions 16/165 dead transitions. [2022-12-06 05:45:20,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 165 transitions, 2071 flow [2022-12-06 05:45:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:45:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:45:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2022-12-06 05:45:20,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-06 05:45:20,097 INFO L175 Difference]: Start difference. First operand has 87 places, 116 transitions, 1351 flow. Second operand 12 states and 88 transitions. [2022-12-06 05:45:20,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 165 transitions, 2071 flow [2022-12-06 05:45:20,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 165 transitions, 2000 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:20,111 INFO L231 Difference]: Finished difference. Result has 101 places, 123 transitions, 1582 flow [2022-12-06 05:45:20,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1582, PETRI_PLACES=101, PETRI_TRANSITIONS=123} [2022-12-06 05:45:20,112 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-06 05:45:20,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:20,112 INFO L89 Accepts]: Start accepts. Operand has 101 places, 123 transitions, 1582 flow [2022-12-06 05:45:20,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:20,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:20,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 123 transitions, 1582 flow [2022-12-06 05:45:20,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 123 transitions, 1582 flow [2022-12-06 05:45:20,141 INFO L130 PetriNetUnfolder]: 74/317 cut-off events. [2022-12-06 05:45:20,142 INFO L131 PetriNetUnfolder]: For 2026/2030 co-relation queries the response was YES. [2022-12-06 05:45:20,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 317 events. 74/317 cut-off events. For 2026/2030 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2000 event pairs, 1 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 1489. Up to 100 conditions per place. [2022-12-06 05:45:20,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 123 transitions, 1582 flow [2022-12-06 05:45:20,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 05:45:20,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_320| v_~f~0.base_209))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_205 (* v_~x2~0_253 4)))) (.cse4 (select .cse2 (+ v_~f~0.offset_205 (* v_~x1~0_316 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_205 (* .cse4 4)))) (.cse3 (select .cse2 (+ v_~f~0.offset_205 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_209)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_148| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_164|) (= (ite (and (< .cse1 v_~size~0_209) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_148|) (= v_~x1~0_315 (select .cse2 (+ v_~f~0.offset_205 (* 4 .cse1)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (< 2 (mod (* 3 v_~n~0_199) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_205 (* .cse3 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_164| 0)) (not (= (ite (and (<= 0 v_~x1~0_316) (< v_~x1~0_316 v_~size~0_209)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_209| 3) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_209)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_253) (< v_~x2~0_253 v_~size~0_209)) 1 0) 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_159|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_209)) 1 0)))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_209, ~f~0.base=v_~f~0.base_209, #memory_int=|v_#memory_int_320|, ~n~0=v_~n~0_199, ~x1~0=v_~x1~0_316, ~f~0.offset=v_~f~0.offset_205} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_156|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, ~size~0=v_~size~0_209, ~f~0.base=v_~f~0.base_209, 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_125|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~x1~0=v_~x1~0_315, ~f~0.offset=v_~f~0.offset_205, 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_148|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_81|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_209|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_79|, #memory_int=|v_#memory_int_320|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_164|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_89|, ~n~0=v_~n~0_199, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_93|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_166|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 3 v_~n~0_In_6) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:45:20,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:20,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:20,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:21,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:21,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:21,252 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:21,361 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:21,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1250 [2022-12-06 05:45:21,362 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 123 transitions, 1624 flow [2022-12-06 05:45:21,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:45:21,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:21,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:21,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:21,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:21,570 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:45:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash -370844362, now seen corresponding path program 1 times [2022-12-06 05:45:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:21,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465312648] [2022-12-06 05:45:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:22,860 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:22,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:22,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465312648] [2022-12-06 05:45:22,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465312648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:22,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625181256] [2022-12-06 05:45:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:22,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:22,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:22,862 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:22,864 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:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:22,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:45:22,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:22,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:22,972 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 22 treesize of output 24 [2022-12-06 05:45:23,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:23,038 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 05:45:23,049 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:23,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:23,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:23,154 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 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-06 05:45:23,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:23,207 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:45:24,283 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:24,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625181256] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:24,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:24,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:45:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85890090] [2022-12-06 05:45:24,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:24,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:45:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:45:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:45:24,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:45:24,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 123 transitions, 1624 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:24,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:24,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:45:24,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:25,002 INFO L130 PetriNetUnfolder]: 577/1104 cut-off events. [2022-12-06 05:45:25,002 INFO L131 PetriNetUnfolder]: For 8148/8148 co-relation queries the response was YES. [2022-12-06 05:45:25,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 1104 events. 577/1104 cut-off events. For 8148/8148 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5818 event pairs, 90 based on Foata normal form. 1/1105 useless extension candidates. Maximal degree in co-relation 5842. Up to 835 conditions per place. [2022-12-06 05:45:25,011 INFO L137 encePairwiseOnDemand]: 15/41 looper letters, 113 selfloop transitions, 55 changer transitions 4/172 dead transitions. [2022-12-06 05:45:25,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 172 transitions, 2323 flow [2022-12-06 05:45:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:45:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:45:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2022-12-06 05:45:25,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20842572062084258 [2022-12-06 05:45:25,013 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 1624 flow. Second operand 11 states and 94 transitions. [2022-12-06 05:45:25,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 172 transitions, 2323 flow [2022-12-06 05:45:25,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 172 transitions, 2174 flow, removed 59 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:25,033 INFO L231 Difference]: Finished difference. Result has 110 places, 131 transitions, 1796 flow [2022-12-06 05:45:25,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1796, PETRI_PLACES=110, PETRI_TRANSITIONS=131} [2022-12-06 05:45:25,033 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:45:25,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:25,033 INFO L89 Accepts]: Start accepts. Operand has 110 places, 131 transitions, 1796 flow [2022-12-06 05:45:25,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:25,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:25,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 131 transitions, 1796 flow [2022-12-06 05:45:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 131 transitions, 1796 flow [2022-12-06 05:45:25,087 INFO L130 PetriNetUnfolder]: 79/335 cut-off events. [2022-12-06 05:45:25,088 INFO L131 PetriNetUnfolder]: For 2368/2372 co-relation queries the response was YES. [2022-12-06 05:45:25,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 335 events. 79/335 cut-off events. For 2368/2372 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2161 event pairs, 1 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 1532. Up to 104 conditions per place. [2022-12-06 05:45:25,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 131 transitions, 1796 flow [2022-12-06 05:45:25,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 05:45:25,092 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:25,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 05:45:25,094 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 131 transitions, 1796 flow [2022-12-06 05:45:25,094 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:45:25,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:25,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:25,112 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:25,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:25,298 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:45:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1667431495, now seen corresponding path program 1 times [2022-12-06 05:45:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:25,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102162659] [2022-12-06 05:45:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:25,370 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:25,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:25,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102162659] [2022-12-06 05:45:25,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102162659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:25,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:25,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:45:25,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441484883] [2022-12-06 05:45:25,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:25,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:45:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:45:25,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:45:25,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:45:25,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 131 transitions, 1796 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:45:25,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:25,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:45:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:25,572 INFO L130 PetriNetUnfolder]: 558/1051 cut-off events. [2022-12-06 05:45:25,572 INFO L131 PetriNetUnfolder]: For 9622/9622 co-relation queries the response was YES. [2022-12-06 05:45:25,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 1051 events. 558/1051 cut-off events. For 9622/9622 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5337 event pairs, 136 based on Foata normal form. 8/1059 useless extension candidates. Maximal degree in co-relation 5297. Up to 629 conditions per place. [2022-12-06 05:45:25,584 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 157 selfloop transitions, 8 changer transitions 5/170 dead transitions. [2022-12-06 05:45:25,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 170 transitions, 2609 flow [2022-12-06 05:45:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:45:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:45:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 05:45:25,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2022-12-06 05:45:25,585 INFO L175 Difference]: Start difference. First operand has 109 places, 131 transitions, 1796 flow. Second operand 3 states and 49 transitions. [2022-12-06 05:45:25,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 170 transitions, 2609 flow [2022-12-06 05:45:25,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 170 transitions, 2469 flow, removed 46 selfloop flow, removed 6 redundant places. [2022-12-06 05:45:25,612 INFO L231 Difference]: Finished difference. Result has 105 places, 127 transitions, 1609 flow [2022-12-06 05:45:25,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1609, PETRI_PLACES=105, PETRI_TRANSITIONS=127} [2022-12-06 05:45:25,612 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 05:45:25,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:25,612 INFO L89 Accepts]: Start accepts. Operand has 105 places, 127 transitions, 1609 flow [2022-12-06 05:45:25,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:25,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:25,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 127 transitions, 1609 flow [2022-12-06 05:45:25,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 127 transitions, 1609 flow [2022-12-06 05:45:25,642 INFO L130 PetriNetUnfolder]: 78/320 cut-off events. [2022-12-06 05:45:25,643 INFO L131 PetriNetUnfolder]: For 1973/1977 co-relation queries the response was YES. [2022-12-06 05:45:25,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 320 events. 78/320 cut-off events. For 1973/1977 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1958 event pairs, 1 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1443. Up to 101 conditions per place. [2022-12-06 05:45:25,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 127 transitions, 1609 flow [2022-12-06 05:45:25,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 05:45:25,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_271| v_~f~0.base_171))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_167 (* v_~x2~0_193 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_167 (* .cse1 4))))) (and (= (ite (and (< .cse0 v_~size~0_171) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (= |v_thread1Thread1of1ForFork0_~i~0#1_147| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (= (ite (and (< v_~x1~0_222 v_~size~0_171) (<= 0 v_~x1~0_222)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_171)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (= v_~x1~0_221 (select .cse2 (+ v_~f~0.offset_167 (* v_~x1~0_222 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_147| 4294967295) 4294967296) (mod (* 3 v_~n~0_159) 4294967296)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_117|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| 0)) (= (select .cse2 (+ v_~f~0.offset_167 (* .cse0 4))) v_~x2~0_192) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (<= 0 v_~x2~0_193) (< v_~x2~0_193 v_~size~0_171)) 1 0) 0)))))) InVars {~x2~0=v_~x2~0_193, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, #memory_int=|v_#memory_int_271|, ~n~0=v_~n~0_159, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_167} OutVars{~x2~0=v_~x2~0_192, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_53|, 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_117|, ~x1~0=v_~x1~0_221, ~f~0.offset=v_~f~0.offset_167, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_147|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ~n~0=v_~n~0_159, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_57|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_110|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [693] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_312| v_~f~0.base_203))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_199 (* v_~x2~0_237 4))))) (let ((.cse0 (mod (* 3 v_~n~0_191) 4294967296)) (.cse3 (select .cse2 (+ v_~f~0.offset_199 (* .cse1 4))))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_146| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147| 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_146|) |v_thread2Thread1of1ForFork1_~i~1#1_145|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|) (not (= (ite (and (< .cse1 v_~size~0_203) (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_199 (* v_~x1~0_298 4))) v_~x1~0_297) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_153|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_153| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| (ite (and (<= 0 v_~x1~0_298) (< v_~x1~0_298 v_~size~0_203)) 1 0)) (not (= (ite (and (< v_~x2~0_237 v_~size~0_203) (<= 0 v_~x2~0_237)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_195| 1) |v_thread1Thread1of1ForFork0_~i~0#1_194|) (= (select .cse2 (+ v_~f~0.offset_199 (* 4 .cse3))) v_~x2~0_236) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_195| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| (ite (and (< .cse3 v_~size~0_203) (<= 0 .cse3)) 1 0)))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_203, ~f~0.base=v_~f~0.base_203, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, #memory_int=|v_#memory_int_312|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_146|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_298, ~f~0.offset=v_~f~0.offset_199} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_145|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, ~size~0=v_~size~0_203, ~f~0.base=v_~f~0.base_203, 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_115|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_145|, ~x1~0=v_~x1~0_297, ~f~0.offset=v_~f~0.offset_199, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_71|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_69|, #memory_int=|v_#memory_int_312|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_79|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_83|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_155|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:45:26,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_271| v_~f~0.base_171))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_167 (* v_~x2~0_193 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_167 (* .cse1 4))))) (and (= (ite (and (< .cse0 v_~size~0_171) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (= |v_thread1Thread1of1ForFork0_~i~0#1_147| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (= (ite (and (< v_~x1~0_222 v_~size~0_171) (<= 0 v_~x1~0_222)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_171)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (= v_~x1~0_221 (select .cse2 (+ v_~f~0.offset_167 (* v_~x1~0_222 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_147| 4294967295) 4294967296) (mod (* 3 v_~n~0_159) 4294967296)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_117|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| 0)) (= (select .cse2 (+ v_~f~0.offset_167 (* .cse0 4))) v_~x2~0_192) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (<= 0 v_~x2~0_193) (< v_~x2~0_193 v_~size~0_171)) 1 0) 0)))))) InVars {~x2~0=v_~x2~0_193, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, #memory_int=|v_#memory_int_271|, ~n~0=v_~n~0_159, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_167} OutVars{~x2~0=v_~x2~0_192, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_53|, 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_117|, ~x1~0=v_~x1~0_221, ~f~0.offset=v_~f~0.offset_167, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_147|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ~n~0=v_~n~0_159, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_57|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_110|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [692] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_310| v_~f~0.base_201))) (let ((.cse2 (mod (* 3 v_~n~0_189) 4294967296)) (.cse1 (select .cse0 (+ v_~f~0.offset_197 (* v_~x1~0_293 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|) (= (select .cse0 (+ v_~f~0.offset_197 (* .cse1 4))) v_~x1~0_291) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_190| 1) 4294967296) .cse2) (not (= 0 (ite (and (< v_~x1~0_293 v_~size~0_201) (<= 0 v_~x1~0_293)) 1 0))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_190| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_188| (+ |v_thread1Thread1of1ForFork0_~i~0#1_190| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133| (ite (and (< .cse1 v_~size~0_201) (<= 0 .cse1)) 1 0))))) InVars {~size~0=v_~size~0_201, ~f~0.base=v_~f~0.base_201, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_190|, #memory_int=|v_#memory_int_310|, ~n~0=v_~n~0_189, ~x1~0=v_~x1~0_293, ~f~0.offset=v_~f~0.offset_197} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|, ~size~0=v_~size~0_201, ~f~0.base=v_~f~0.base_201, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_188|, #memory_int=|v_#memory_int_310|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|, ~n~0=v_~n~0_189, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_151|, ~x1~0=v_~x1~0_291, ~f~0.offset=v_~f~0.offset_197} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:26,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [715] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_349| v_~f~0.base_233))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_229 (* v_~x2~0_281 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_229 (* v_~x1~0_374 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_229 (* .cse3 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_229 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_233)) 1 0) 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= (select .cse1 (+ v_~f~0.offset_229 (* 4 .cse2))) v_~x1~0_372) (not (= (ite (and (< v_~x2~0_281 v_~size~0_233) (<= 0 v_~x2~0_281)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_233) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176| 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_233)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|) (not (= (ite (and (< v_~x1~0_374 v_~size~0_233) (<= 0 v_~x1~0_374)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_253| 3) (< 2 (mod (* 3 v_~n~0_223) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| (ite (and (< .cse4 v_~size~0_233) (<= 0 .cse4)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_229 (* .cse4 4))) v_~x2~0_280))))) InVars {~x2~0=v_~x2~0_281, ~size~0=v_~size~0_233, ~f~0.base=v_~f~0.base_233, #memory_int=|v_#memory_int_349|, ~n~0=v_~n~0_223, ~x1~0=v_~x1~0_374, ~f~0.offset=v_~f~0.offset_229} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_188|, ~x2~0=v_~x2~0_280, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_136|, ~size~0=v_~size~0_233, ~f~0.base=v_~f~0.base_233, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_108|, 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_190|, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_229, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_100|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_253|, #memory_int=|v_#memory_int_349|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_98|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_108|, ~n~0=v_~n~0_223, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_112|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:27,504 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:27,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1893 [2022-12-06 05:45:27,505 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1658 flow [2022-12-06 05:45:27,505 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:45:27,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:27,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:27,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:45:27,505 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:45:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash 825073917, now seen corresponding path program 2 times [2022-12-06 05:45:27,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:27,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533119970] [2022-12-06 05:45:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:27,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:27,596 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:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:27,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533119970] [2022-12-06 05:45:27,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533119970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:27,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:27,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581744044] [2022-12-06 05:45:27,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:27,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:27,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:27,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:27,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:45:27,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1658 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:27,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:27,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:45:27,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:27,936 INFO L130 PetriNetUnfolder]: 550/1082 cut-off events. [2022-12-06 05:45:27,936 INFO L131 PetriNetUnfolder]: For 8885/8885 co-relation queries the response was YES. [2022-12-06 05:45:27,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6289 conditions, 1082 events. 550/1082 cut-off events. For 8885/8885 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5826 event pairs, 110 based on Foata normal form. 12/1092 useless extension candidates. Maximal degree in co-relation 5702. Up to 520 conditions per place. [2022-12-06 05:45:27,946 INFO L137 encePairwiseOnDemand]: 19/41 looper letters, 155 selfloop transitions, 32 changer transitions 12/199 dead transitions. [2022-12-06 05:45:27,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 199 transitions, 2734 flow [2022-12-06 05:45:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:45:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:45:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-06 05:45:27,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23035230352303523 [2022-12-06 05:45:27,948 INFO L175 Difference]: Start difference. First operand has 105 places, 127 transitions, 1658 flow. Second operand 9 states and 85 transitions. [2022-12-06 05:45:27,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 199 transitions, 2734 flow [2022-12-06 05:45:27,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 199 transitions, 2677 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:27,970 INFO L231 Difference]: Finished difference. Result has 112 places, 127 transitions, 1680 flow [2022-12-06 05:45:27,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1680, PETRI_PLACES=112, PETRI_TRANSITIONS=127} [2022-12-06 05:45:27,970 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-06 05:45:27,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:27,970 INFO L89 Accepts]: Start accepts. Operand has 112 places, 127 transitions, 1680 flow [2022-12-06 05:45:27,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:27,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:27,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 127 transitions, 1680 flow [2022-12-06 05:45:27,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 127 transitions, 1680 flow [2022-12-06 05:45:28,001 INFO L130 PetriNetUnfolder]: 80/329 cut-off events. [2022-12-06 05:45:28,001 INFO L131 PetriNetUnfolder]: For 2232/2236 co-relation queries the response was YES. [2022-12-06 05:45:28,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 329 events. 80/329 cut-off events. For 2232/2236 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2023 event pairs, 1 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1679. Up to 99 conditions per place. [2022-12-06 05:45:28,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 127 transitions, 1680 flow [2022-12-06 05:45:28,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 05:45:28,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_304| v_~f~0.base_197))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_193 (* v_~x2~0_233 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_193 (* v_~x1~0_282 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_193 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|) (= (ite (and (< .cse0 v_~size~0_197) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_197)) 1 0)) (= v_~x1~0_281 (select .cse2 (+ v_~f~0.offset_193 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|) (not (= (ite (and (< .cse3 v_~size~0_197) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_282 v_~size~0_197) (<= 0 v_~x1~0_282)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145| 0)) (= v_~x2~0_232 (select .cse2 (+ v_~f~0.offset_193 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_143|) (= |v_thread1Thread1of1ForFork0_~i~0#1_182| 2) (not (= 0 (ite (and (<= 0 v_~x2~0_233) (< v_~x2~0_233 v_~size~0_197)) 1 0))) (< 1 (mod (* 3 v_~n~0_185) 4294967296)))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_197, ~f~0.base=v_~f~0.base_197, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_185, ~x1~0=v_~x1~0_282, ~f~0.offset=v_~f~0.offset_193} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_135|, ~x2~0=v_~x2~0_232, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_197, ~f~0.base=v_~f~0.base_197, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_77|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_143|, ~x1~0=v_~x1~0_281, ~f~0.offset=v_~f~0.offset_193, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_69|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_182|, #memory_int=|v_#memory_int_304|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_67|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_77|, ~n~0=v_~n~0_185, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_145|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_81|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:28,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:28,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 872 [2022-12-06 05:45:28,842 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 1702 flow [2022-12-06 05:45:28,842 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:28,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:28,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:28,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:45:28,842 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:45:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 145999250, now seen corresponding path program 1 times [2022-12-06 05:45:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:28,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896042010] [2022-12-06 05:45:28,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:29,377 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:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:29,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896042010] [2022-12-06 05:45:29,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896042010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:29,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:29,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:45:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152296900] [2022-12-06 05:45:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:29,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:45:29,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 127 transitions, 1702 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:45:29,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:29,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:45:29,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:29,695 INFO L130 PetriNetUnfolder]: 545/1040 cut-off events. [2022-12-06 05:45:29,695 INFO L131 PetriNetUnfolder]: For 9018/9018 co-relation queries the response was YES. [2022-12-06 05:45:29,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 1040 events. 545/1040 cut-off events. For 9018/9018 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5324 event pairs, 244 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 6060. Up to 960 conditions per place. [2022-12-06 05:45:29,702 INFO L137 encePairwiseOnDemand]: 18/40 looper letters, 102 selfloop transitions, 32 changer transitions 8/142 dead transitions. [2022-12-06 05:45:29,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 2097 flow [2022-12-06 05:45:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 05:45:29,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 05:45:29,703 INFO L175 Difference]: Start difference. First operand has 106 places, 127 transitions, 1702 flow. Second operand 4 states and 55 transitions. [2022-12-06 05:45:29,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 142 transitions, 2097 flow [2022-12-06 05:45:29,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 142 transitions, 1990 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-12-06 05:45:29,724 INFO L231 Difference]: Finished difference. Result has 105 places, 126 transitions, 1685 flow [2022-12-06 05:45:29,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1685, PETRI_PLACES=105, PETRI_TRANSITIONS=126} [2022-12-06 05:45:29,725 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 05:45:29,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:29,725 INFO L89 Accepts]: Start accepts. Operand has 105 places, 126 transitions, 1685 flow [2022-12-06 05:45:29,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:29,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:29,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 126 transitions, 1685 flow [2022-12-06 05:45:29,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 126 transitions, 1685 flow [2022-12-06 05:45:29,753 INFO L130 PetriNetUnfolder]: 79/326 cut-off events. [2022-12-06 05:45:29,754 INFO L131 PetriNetUnfolder]: For 2051/2055 co-relation queries the response was YES. [2022-12-06 05:45:29,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 326 events. 79/326 cut-off events. For 2051/2055 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2020 event pairs, 1 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 1679. Up to 99 conditions per place. [2022-12-06 05:45:29,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 126 transitions, 1685 flow [2022-12-06 05:45:29,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 05:45:30,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_351| v_~f~0.base_235))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_231 (* v_~x2~0_286 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_231 (* .cse2 4))))) (let ((.cse5 (select .cse0 (+ (* .cse7 4) v_~f~0.offset_231)))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_231 (* .cse5 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_231 (* v_~x1~0_379 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_231 (* .cse3 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_231 (* .cse4 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_286) (< v_~x2~0_286 v_~size~0_235)) 1 0) 0)) (= v_~x1~0_378 (select .cse0 (+ v_~f~0.offset_231 (* .cse1 4)))) (not (= 0 (ite (and (< .cse2 v_~size~0_235) (<= 0 .cse2)) 1 0))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_235)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_235) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_235)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_235)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_257| 3) (not (= (ite (and (< v_~x1~0_379 v_~size~0_235) (<= 0 v_~x1~0_379)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| (ite (and (< .cse6 v_~size~0_235) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_235) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_178|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_178| 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_192|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|) (= (select .cse0 (+ v_~f~0.offset_231 (* .cse6 4))) v_~x2~0_284) (< 3 (mod (* 3 v_~n~0_225) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200| 0))))))))) InVars {~x2~0=v_~x2~0_286, ~size~0=v_~size~0_235, ~f~0.base=v_~f~0.base_235, #memory_int=|v_#memory_int_351|, ~n~0=v_~n~0_225, ~x1~0=v_~x1~0_379, ~f~0.offset=v_~f~0.offset_231} OutVars{~x2~0=v_~x2~0_284, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_192|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_138|, ~size~0=v_~size~0_235, ~f~0.base=v_~f~0.base_235, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_110|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_192|, ~x1~0=v_~x1~0_378, ~f~0.offset=v_~f~0.offset_231, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_178|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_102|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_100|, #memory_int=|v_#memory_int_351|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_110|, ~n~0=v_~n~0_225, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_114|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_202|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 3 v_~n~0_In_6) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:45:31,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:31,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_298| v_~f~0.base_191))) (let ((.cse4 (select .cse2 (+ (* v_~x2~0_218 4) v_~f~0.offset_187)))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_187 (* 4 .cse4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_187 (* .cse5 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_187 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_187 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (not (= (ite (and (< .cse0 v_~size~0_191) (<= 0 .cse0)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_133|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (and (< .cse1 v_~size~0_191) (<= 0 .cse1)) 1 0)) (= v_~x2~0_216 (select .cse2 (+ v_~f~0.offset_187 (* .cse1 4)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_191)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_191) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_218) (< v_~x2~0_218 v_~size~0_191)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_191)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_133| 4294967293) 4294967296) (mod (* 3 v_~n~0_179) 4294967296))))))))) InVars {~x2~0=v_~x2~0_218, ~size~0=v_~size~0_191, ~f~0.base=v_~f~0.base_191, #memory_int=|v_#memory_int_298|, ~n~0=v_~n~0_179, ~f~0.offset=v_~f~0.offset_187} OutVars{~x2~0=v_~x2~0_216, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, ~size~0=v_~size~0_191, ~f~0.base=v_~f~0.base_191, 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_103|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_133|, ~f~0.offset=v_~f~0.offset_187, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_59|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_57|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_67|, ~n~0=v_~n~0_179, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:32,323 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:45:32,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2599 [2022-12-06 05:45:32,324 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 1762 flow [2022-12-06 05:45:32,324 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:45:32,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:32,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:32,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:45:32,325 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:45:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1882138312, now seen corresponding path program 1 times [2022-12-06 05:45:32,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:32,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684789475] [2022-12-06 05:45:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:32,387 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:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684789475] [2022-12-06 05:45:32,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684789475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:32,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:32,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51786425] [2022-12-06 05:45:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:32,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:32,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:32,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:32,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 05:45:32,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 1762 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:32,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:32,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 05:45:32,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:32,615 INFO L130 PetriNetUnfolder]: 509/945 cut-off events. [2022-12-06 05:45:32,615 INFO L131 PetriNetUnfolder]: For 7455/7455 co-relation queries the response was YES. [2022-12-06 05:45:32,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5958 conditions, 945 events. 509/945 cut-off events. For 7455/7455 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4507 event pairs, 219 based on Foata normal form. 30/973 useless extension candidates. Maximal degree in co-relation 5635. Up to 798 conditions per place. [2022-12-06 05:45:32,621 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 95 selfloop transitions, 27 changer transitions 17/139 dead transitions. [2022-12-06 05:45:32,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 2196 flow [2022-12-06 05:45:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 05:45:32,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-06 05:45:32,622 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 1762 flow. Second operand 4 states and 56 transitions. [2022-12-06 05:45:32,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 2196 flow [2022-12-06 05:45:32,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 2115 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:32,640 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 1591 flow [2022-12-06 05:45:32,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1591, PETRI_PLACES=103, PETRI_TRANSITIONS=115} [2022-12-06 05:45:32,640 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 05:45:32,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:32,640 INFO L89 Accepts]: Start accepts. Operand has 103 places, 115 transitions, 1591 flow [2022-12-06 05:45:32,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:32,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:32,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 115 transitions, 1591 flow [2022-12-06 05:45:32,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 115 transitions, 1591 flow [2022-12-06 05:45:32,667 INFO L130 PetriNetUnfolder]: 76/273 cut-off events. [2022-12-06 05:45:32,667 INFO L131 PetriNetUnfolder]: For 2002/2006 co-relation queries the response was YES. [2022-12-06 05:45:32,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 273 events. 76/273 cut-off events. For 2002/2006 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1477 event pairs, 1 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 1459. Up to 101 conditions per place. [2022-12-06 05:45:32,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 115 transitions, 1591 flow [2022-12-06 05:45:32,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 05:45:32,670 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:32,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 05:45:32,671 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 115 transitions, 1591 flow [2022-12-06 05:45:32,672 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:32,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:32,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:32,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:45:32,672 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:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash -845534643, now seen corresponding path program 1 times [2022-12-06 05:45:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528772373] [2022-12-06 05:45:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:32,740 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:32,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:32,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528772373] [2022-12-06 05:45:32,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528772373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:32,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:32,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23098732] [2022-12-06 05:45:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:32,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:32,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:32,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:45:32,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 115 transitions, 1591 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:32,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:32,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:45:32,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:33,006 INFO L130 PetriNetUnfolder]: 487/891 cut-off events. [2022-12-06 05:45:33,007 INFO L131 PetriNetUnfolder]: For 7030/7030 co-relation queries the response was YES. [2022-12-06 05:45:33,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 891 events. 487/891 cut-off events. For 7030/7030 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4132 event pairs, 213 based on Foata normal form. 4/895 useless extension candidates. Maximal degree in co-relation 5214. Up to 771 conditions per place. [2022-12-06 05:45:33,012 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 95 selfloop transitions, 38 changer transitions 3/136 dead transitions. [2022-12-06 05:45:33,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 136 transitions, 2085 flow [2022-12-06 05:45:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-06 05:45:33,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2606837606837607 [2022-12-06 05:45:33,032 INFO L175 Difference]: Start difference. First operand has 97 places, 115 transitions, 1591 flow. Second operand 6 states and 61 transitions. [2022-12-06 05:45:33,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 136 transitions, 2085 flow [2022-12-06 05:45:33,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 2031 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:33,047 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 1698 flow [2022-12-06 05:45:33,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1698, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2022-12-06 05:45:33,048 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 81 predicate places. [2022-12-06 05:45:33,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:33,048 INFO L89 Accepts]: Start accepts. Operand has 102 places, 118 transitions, 1698 flow [2022-12-06 05:45:33,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:33,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:33,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 118 transitions, 1698 flow [2022-12-06 05:45:33,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 118 transitions, 1698 flow [2022-12-06 05:45:33,075 INFO L130 PetriNetUnfolder]: 78/275 cut-off events. [2022-12-06 05:45:33,075 INFO L131 PetriNetUnfolder]: For 2352/2356 co-relation queries the response was YES. [2022-12-06 05:45:33,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 275 events. 78/275 cut-off events. For 2352/2356 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1478 event pairs, 1 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 1540. Up to 100 conditions per place. [2022-12-06 05:45:33,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 118 transitions, 1698 flow [2022-12-06 05:45:33,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 05:45:33,078 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:33,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 05:45:33,079 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 1698 flow [2022-12-06 05:45:33,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:33,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:33,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:33,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:45:33,080 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:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash -180227545, now seen corresponding path program 1 times [2022-12-06 05:45:33,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:33,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636862542] [2022-12-06 05:45:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:33,151 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:33,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:33,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636862542] [2022-12-06 05:45:33,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636862542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:33,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970792569] [2022-12-06 05:45:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:33,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:33,152 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:33,155 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:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:33,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 05:45:33,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:33,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:33,255 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:33,258 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:33,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:33,286 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 22 treesize of output 22 [2022-12-06 05:45:33,617 INFO L321 Elim1Store]: treesize reduction 259, result has 10.4 percent of original size [2022-12-06 05:45:33,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 17 new quantified variables, introduced 36 case distinctions, treesize of input 115 treesize of output 88 [2022-12-06 05:45:33,652 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:33,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:34,335 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:34,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970792569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:34,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:34,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 05:45:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750725877] [2022-12-06 05:45:34,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:45:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:45:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:45:34,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:45:34,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 118 transitions, 1698 flow. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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:34,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:34,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:45:34,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:37,630 INFO L130 PetriNetUnfolder]: 545/1004 cut-off events. [2022-12-06 05:45:37,631 INFO L131 PetriNetUnfolder]: For 9715/9715 co-relation queries the response was YES. [2022-12-06 05:45:37,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6575 conditions, 1004 events. 545/1004 cut-off events. For 9715/9715 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4944 event pairs, 195 based on Foata normal form. 17/1021 useless extension candidates. Maximal degree in co-relation 6059. Up to 683 conditions per place. [2022-12-06 05:45:37,637 INFO L137 encePairwiseOnDemand]: 12/39 looper letters, 93 selfloop transitions, 47 changer transitions 40/180 dead transitions. [2022-12-06 05:45:37,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 180 transitions, 2674 flow [2022-12-06 05:45:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:45:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:45:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-12-06 05:45:37,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17467948717948717 [2022-12-06 05:45:37,638 INFO L175 Difference]: Start difference. First operand has 102 places, 118 transitions, 1698 flow. Second operand 16 states and 109 transitions. [2022-12-06 05:45:37,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 180 transitions, 2674 flow [2022-12-06 05:45:37,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 2593 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:37,659 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 1690 flow [2022-12-06 05:45:37,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1690, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2022-12-06 05:45:37,660 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 05:45:37,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:37,660 INFO L89 Accepts]: Start accepts. Operand has 121 places, 115 transitions, 1690 flow [2022-12-06 05:45:37,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:37,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:37,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 115 transitions, 1690 flow [2022-12-06 05:45:37,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 1690 flow [2022-12-06 05:45:37,686 INFO L130 PetriNetUnfolder]: 70/268 cut-off events. [2022-12-06 05:45:37,687 INFO L131 PetriNetUnfolder]: For 2447/2451 co-relation queries the response was YES. [2022-12-06 05:45:37,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 268 events. 70/268 cut-off events. For 2447/2451 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1488 event pairs, 1 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 1592. Up to 92 conditions per place. [2022-12-06 05:45:37,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 1690 flow [2022-12-06 05:45:37,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 05:45:37,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:38,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [697] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_318| v_~f~0.base_207))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_203 (* v_~x2~0_248 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_203 (* .cse4 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_203 (* .cse0 4))))) (let ((.cse7 (select .cse3 (+ (* 4 .cse5) v_~f~0.offset_203)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_203 (* .cse7 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_203 (* .cse2 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_203 (* .cse8 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_203 (* 4 .cse6))))) (and (not (= (ite (and (< .cse0 v_~size~0_207) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_207)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_207)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_153|) (= v_~x2~0_246 (select .cse3 (+ v_~f~0.offset_203 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_248 v_~size~0_207) (<= 0 v_~x2~0_248)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_207)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_207) (<= 0 .cse5)) 1 0) 0)) (= (ite (and (< v_~x1~0_312 v_~size~0_207) (<= 0 v_~x1~0_312)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_146|) (= |v_thread1Thread1of1ForFork0_~i~0#1_205| 1) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_153| 4294967293) 4294967296) (mod (* 3 v_~n~0_195) 4294967296)) (= v_~x1~0_311 (select .cse3 (+ v_~f~0.offset_203 (* v_~x1~0_312 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162| 0)) (not (= (ite (and (< .cse6 v_~size~0_207) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_207)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_146| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_207)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_248, ~size~0=v_~size~0_207, ~f~0.base=v_~f~0.base_207, #memory_int=|v_#memory_int_318|, ~n~0=v_~n~0_195, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_203} OutVars{~x2~0=v_~x2~0_246, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_207, ~f~0.base=v_~f~0.base_207, 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_121|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_153|, ~x1~0=v_~x1~0_311, ~f~0.offset=v_~f~0.offset_203, 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_146|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_77|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_205|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_75|, #memory_int=|v_#memory_int_318|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_85|, ~n~0=v_~n~0_195, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_89|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_164|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:43,599 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:43,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5939 [2022-12-06 05:45:43,599 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 1767 flow [2022-12-06 05:45:43,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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:43,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:43,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:43,613 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:43,800 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,SelfDestructingSolverStorable26 [2022-12-06 05:45:43,800 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:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash -358287517, now seen corresponding path program 1 times [2022-12-06 05:45:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:43,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098622292] [2022-12-06 05:45:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:43,863 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:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:43,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098622292] [2022-12-06 05:45:43,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098622292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:43,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:43,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875021548] [2022-12-06 05:45:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:43,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:43,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:45:43,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 1767 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:43,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:43,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:45:43,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:44,153 INFO L130 PetriNetUnfolder]: 487/921 cut-off events. [2022-12-06 05:45:44,154 INFO L131 PetriNetUnfolder]: For 10906/10906 co-relation queries the response was YES. [2022-12-06 05:45:44,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6176 conditions, 921 events. 487/921 cut-off events. For 10906/10906 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4541 event pairs, 93 based on Foata normal form. 8/927 useless extension candidates. Maximal degree in co-relation 5990. Up to 457 conditions per place. [2022-12-06 05:45:44,159 INFO L137 encePairwiseOnDemand]: 17/39 looper letters, 129 selfloop transitions, 47 changer transitions 4/180 dead transitions. [2022-12-06 05:45:44,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 180 transitions, 2932 flow [2022-12-06 05:45:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:45:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:45:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-12-06 05:45:44,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21082621082621084 [2022-12-06 05:45:44,160 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 1767 flow. Second operand 9 states and 74 transitions. [2022-12-06 05:45:44,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 180 transitions, 2932 flow [2022-12-06 05:45:44,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 180 transitions, 2528 flow, removed 180 selfloop flow, removed 11 redundant places. [2022-12-06 05:45:44,182 INFO L231 Difference]: Finished difference. Result has 116 places, 129 transitions, 1785 flow [2022-12-06 05:45:44,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1785, PETRI_PLACES=116, PETRI_TRANSITIONS=129} [2022-12-06 05:45:44,183 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2022-12-06 05:45:44,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:44,183 INFO L89 Accepts]: Start accepts. Operand has 116 places, 129 transitions, 1785 flow [2022-12-06 05:45:44,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:44,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:44,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 129 transitions, 1785 flow [2022-12-06 05:45:44,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 129 transitions, 1785 flow [2022-12-06 05:45:44,211 INFO L130 PetriNetUnfolder]: 78/292 cut-off events. [2022-12-06 05:45:44,212 INFO L131 PetriNetUnfolder]: For 2436/2440 co-relation queries the response was YES. [2022-12-06 05:45:44,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 292 events. 78/292 cut-off events. For 2436/2440 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1643 event pairs, 1 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 1658. Up to 86 conditions per place. [2022-12-06 05:45:44,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 129 transitions, 1785 flow [2022-12-06 05:45:44,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:45:44,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:44,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:44,437 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:44,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-06 05:45:44,437 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 128 transitions, 1793 flow [2022-12-06 05:45:44,438 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,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:44,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:44,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:45:44,438 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,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1517225268, now seen corresponding path program 1 times [2022-12-06 05:45:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:44,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796973455] [2022-12-06 05:45:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:44,499 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:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:44,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796973455] [2022-12-06 05:45:44,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796973455] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:44,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649483977] [2022-12-06 05:45:44,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:44,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:44,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:44,501 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:44,503 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:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:44,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:45:44,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:44,774 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:44,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:44,790 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:44,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649483977] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:44,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:44,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:45:44,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080848372] [2022-12-06 05:45:44,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:44,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:45:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:44,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:45:44,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:45:44,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:45:44,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 128 transitions, 1793 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:45:44,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:44,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:45:44,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:45,057 INFO L130 PetriNetUnfolder]: 497/936 cut-off events. [2022-12-06 05:45:45,057 INFO L131 PetriNetUnfolder]: For 8570/8570 co-relation queries the response was YES. [2022-12-06 05:45:45,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6126 conditions, 936 events. 497/936 cut-off events. For 8570/8570 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4531 event pairs, 216 based on Foata normal form. 12/948 useless extension candidates. Maximal degree in co-relation 5857. Up to 764 conditions per place. [2022-12-06 05:45:45,063 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 99 selfloop transitions, 17 changer transitions 33/149 dead transitions. [2022-12-06 05:45:45,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 149 transitions, 2365 flow [2022-12-06 05:45:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:45:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:45:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 05:45:45,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22142857142857142 [2022-12-06 05:45:45,080 INFO L175 Difference]: Start difference. First operand has 114 places, 128 transitions, 1793 flow. Second operand 7 states and 62 transitions. [2022-12-06 05:45:45,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 149 transitions, 2365 flow [2022-12-06 05:45:45,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 2278 flow, removed 35 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:45,102 INFO L231 Difference]: Finished difference. Result has 121 places, 109 transitions, 1494 flow [2022-12-06 05:45:45,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1494, PETRI_PLACES=121, PETRI_TRANSITIONS=109} [2022-12-06 05:45:45,104 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 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 121 places, 109 transitions, 1494 flow [2022-12-06 05:45:45,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:45,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:45,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 109 transitions, 1494 flow [2022-12-06 05:45:45,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 1494 flow [2022-12-06 05:45:45,132 INFO L130 PetriNetUnfolder]: 65/273 cut-off events. [2022-12-06 05:45:45,132 INFO L131 PetriNetUnfolder]: For 2389/2393 co-relation queries the response was YES. [2022-12-06 05:45:45,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 273 events. 65/273 cut-off events. For 2389/2393 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1563 event pairs, 1 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 1517. Up to 77 conditions per place. [2022-12-06 05:45:45,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 1494 flow [2022-12-06 05:45:45,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 05:45:45,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:45,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:45,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 521 [2022-12-06 05:45:45,625 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 1512 flow [2022-12-06 05:45:45,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:45:45,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:45,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:45,634 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:45:45,825 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,SelfDestructingSolverStorable28 [2022-12-06 05:45:45,825 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,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -595237370, now seen corresponding path program 1 times [2022-12-06 05:45:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:45,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562149694] [2022-12-06 05:45:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:45,910 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:45,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:45,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562149694] [2022-12-06 05:45:45,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562149694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:45,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:45,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919744517] [2022-12-06 05:45:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:45,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:45,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:45,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:45:45,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 1512 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:45,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:45:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:46,126 INFO L130 PetriNetUnfolder]: 448/861 cut-off events. [2022-12-06 05:45:46,127 INFO L131 PetriNetUnfolder]: For 8574/8574 co-relation queries the response was YES. [2022-12-06 05:45:46,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 861 events. 448/861 cut-off events. For 8574/8574 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4139 event pairs, 230 based on Foata normal form. 12/873 useless extension candidates. Maximal degree in co-relation 5363. Up to 787 conditions per place. [2022-12-06 05:45:46,132 INFO L137 encePairwiseOnDemand]: 22/35 looper letters, 91 selfloop transitions, 17 changer transitions 11/119 dead transitions. [2022-12-06 05:45:46,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 1832 flow [2022-12-06 05:45:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:45:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:45:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 05:45:46,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2742857142857143 [2022-12-06 05:45:46,134 INFO L175 Difference]: Start difference. First operand has 116 places, 109 transitions, 1512 flow. Second operand 5 states and 48 transitions. [2022-12-06 05:45:46,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 1832 flow [2022-12-06 05:45:46,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1750 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-06 05:45:46,151 INFO L231 Difference]: Finished difference. Result has 114 places, 102 transitions, 1407 flow [2022-12-06 05:45:46,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1407, PETRI_PLACES=114, PETRI_TRANSITIONS=102} [2022-12-06 05:45:46,152 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 05:45:46,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:46,152 INFO L89 Accepts]: Start accepts. Operand has 114 places, 102 transitions, 1407 flow [2022-12-06 05:45:46,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:46,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:46,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 102 transitions, 1407 flow [2022-12-06 05:45:46,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 1407 flow [2022-12-06 05:45:46,176 INFO L130 PetriNetUnfolder]: 61/260 cut-off events. [2022-12-06 05:45:46,176 INFO L131 PetriNetUnfolder]: For 2196/2200 co-relation queries the response was YES. [2022-12-06 05:45:46,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 260 events. 61/260 cut-off events. For 2196/2200 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1462 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 1413. Up to 77 conditions per place. [2022-12-06 05:45:46,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 1407 flow [2022-12-06 05:45:46,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 05:45:46,179 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:46,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 05:45:46,180 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 1407 flow [2022-12-06 05:45:46,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:46,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:46,180 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:46,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:45:46,180 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,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash -589499500, now seen corresponding path program 1 times [2022-12-06 05:45:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710300562] [2022-12-06 05:45:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:46,271 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,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:46,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710300562] [2022-12-06 05:45:46,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710300562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:46,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:46,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952808443] [2022-12-06 05:45:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:46,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:46,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:46,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:46,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:45:46,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 1407 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:46,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:46,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:45:46,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:46,497 INFO L130 PetriNetUnfolder]: 437/868 cut-off events. [2022-12-06 05:45:46,497 INFO L131 PetriNetUnfolder]: For 7929/7929 co-relation queries the response was YES. [2022-12-06 05:45:46,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5433 conditions, 868 events. 437/868 cut-off events. For 7929/7929 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4396 event pairs, 90 based on Foata normal form. 4/872 useless extension candidates. Maximal degree in co-relation 5319. Up to 434 conditions per place. [2022-12-06 05:45:46,503 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 128 selfloop transitions, 26 changer transitions 3/157 dead transitions. [2022-12-06 05:45:46,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 157 transitions, 2355 flow [2022-12-06 05:45:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 05:45:46,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2828282828282828 [2022-12-06 05:45:46,504 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 1407 flow. Second operand 6 states and 56 transitions. [2022-12-06 05:45:46,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 157 transitions, 2355 flow [2022-12-06 05:45:46,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 157 transitions, 2272 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-06 05:45:46,521 INFO L231 Difference]: Finished difference. Result has 110 places, 105 transitions, 1465 flow [2022-12-06 05:45:46,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1465, PETRI_PLACES=110, PETRI_TRANSITIONS=105} [2022-12-06 05:45:46,522 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:45:46,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:46,522 INFO L89 Accepts]: Start accepts. Operand has 110 places, 105 transitions, 1465 flow [2022-12-06 05:45:46,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:46,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:46,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 1465 flow [2022-12-06 05:45:46,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 1465 flow [2022-12-06 05:45:46,548 INFO L130 PetriNetUnfolder]: 63/286 cut-off events. [2022-12-06 05:45:46,548 INFO L131 PetriNetUnfolder]: For 2493/2497 co-relation queries the response was YES. [2022-12-06 05:45:46,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 286 events. 63/286 cut-off events. For 2493/2497 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1669 event pairs, 1 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 1518. Up to 83 conditions per place. [2022-12-06 05:45:46,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 1465 flow [2022-12-06 05:45:46,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-06 05:45:46,551 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:46,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:45:46,552 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 105 transitions, 1465 flow [2022-12-06 05:45:46,552 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:46,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:46,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:46,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:45:46,552 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,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2015994296, now seen corresponding path program 2 times [2022-12-06 05:45:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:46,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115890601] [2022-12-06 05:45:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:46,621 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,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115890601] [2022-12-06 05:45:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115890601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:46,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:46,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:45:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718601673] [2022-12-06 05:45:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:45:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:45:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:45:46,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:45:46,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 1465 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:46,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:46,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:45:46,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:46,836 INFO L130 PetriNetUnfolder]: 422/836 cut-off events. [2022-12-06 05:45:46,836 INFO L131 PetriNetUnfolder]: For 8208/8208 co-relation queries the response was YES. [2022-12-06 05:45:46,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 836 events. 422/836 cut-off events. For 8208/8208 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4070 event pairs, 212 based on Foata normal form. 8/844 useless extension candidates. Maximal degree in co-relation 4949. Up to 749 conditions per place. [2022-12-06 05:45:46,841 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 89 selfloop transitions, 17 changer transitions 13/119 dead transitions. [2022-12-06 05:45:46,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 1819 flow [2022-12-06 05:45:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-06 05:45:46,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 05:45:46,842 INFO L175 Difference]: Start difference. First operand has 110 places, 105 transitions, 1465 flow. Second operand 6 states and 54 transitions. [2022-12-06 05:45:46,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 1819 flow [2022-12-06 05:45:46,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1793 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:46,860 INFO L231 Difference]: Finished difference. Result has 115 places, 98 transitions, 1377 flow [2022-12-06 05:45:46,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1377, PETRI_PLACES=115, PETRI_TRANSITIONS=98} [2022-12-06 05:45:46,860 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 05:45:46,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:46,860 INFO L89 Accepts]: Start accepts. Operand has 115 places, 98 transitions, 1377 flow [2022-12-06 05:45:46,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:46,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:46,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 98 transitions, 1377 flow [2022-12-06 05:45:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 98 transitions, 1377 flow [2022-12-06 05:45:46,885 INFO L130 PetriNetUnfolder]: 60/259 cut-off events. [2022-12-06 05:45:46,885 INFO L131 PetriNetUnfolder]: For 2275/2279 co-relation queries the response was YES. [2022-12-06 05:45:46,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 259 events. 60/259 cut-off events. For 2275/2279 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1434 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 1432. Up to 81 conditions per place. [2022-12-06 05:45:46,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 98 transitions, 1377 flow [2022-12-06 05:45:46,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 05:45:47,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_398| v_~f~0.base_279)) (.cse2 (select (select |v_#memory_int_399| v_~f~0.base_279) (+ v_~f~0.offset_275 (* v_~x1~0_466 4))))) (let ((.cse1 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_275)))) (and (not (= (ite (and (< v_~x1~0_466 v_~size~0_279) (<= 0 v_~x1~0_466)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249| 0)) (= v_~x1~0_464 (select .cse0 (+ v_~f~0.offset_275 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_279)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_279)) 1 0) 0)) (= (+ |v_#pthreadsForks_172| 1) |v_#pthreadsForks_171|) (= (store |v_#memory_int_399| |v_ULTIMATE.start_main_~#t2~0#1.base_99| (store (select |v_#memory_int_399| |v_ULTIMATE.start_main_~#t2~0#1.base_99|) |v_ULTIMATE.start_main_~#t2~0#1.offset_95| |v_ULTIMATE.start_main_#t~pre14#1_113|)) |v_#memory_int_398|) (= |v_ULTIMATE.start_main_#t~pre14#1_113| |v_#pthreadsForks_172|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|) (= |v_thread1Thread1of1ForFork0_~i~0#1_319| 3) (< 2 (mod (* 3 v_~n~0_269) 4294967296))))) InVars {~size~0=v_~size~0_279, #pthreadsForks=|v_#pthreadsForks_172|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_95|, ~f~0.base=v_~f~0.base_279, #memory_int=|v_#memory_int_399|, ~n~0=v_~n~0_269, ~x1~0=v_~x1~0_466, ~f~0.offset=v_~f~0.offset_275, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_99|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_241|, ~size~0=v_~size~0_279, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_95|, ~f~0.base=v_~f~0.base_279, ~x1~0=v_~x1~0_464, ~f~0.offset=v_~f~0.offset_275, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_121|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_113|, #pthreadsForks=|v_#pthreadsForks_171|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_319|, #memory_int=|v_#memory_int_398|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_91|, ~n~0=v_~n~0_269, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_99|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:47,636 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:45:47,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 777 [2022-12-06 05:45:47,637 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 1351 flow [2022-12-06 05:45:47,637 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:47,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:47,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:47,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:45:47,637 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:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1663344253, now seen corresponding path program 1 times [2022-12-06 05:45:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204814672] [2022-12-06 05:45:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:47,685 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:47,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:47,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204814672] [2022-12-06 05:45:47,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204814672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:47,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:47,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430004218] [2022-12-06 05:45:47,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:47,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:47,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:47,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:47,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:47,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:45:47,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 1351 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:47,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:47,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:45:47,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:47,838 INFO L130 PetriNetUnfolder]: 381/732 cut-off events. [2022-12-06 05:45:47,838 INFO L131 PetriNetUnfolder]: For 6891/6891 co-relation queries the response was YES. [2022-12-06 05:45:47,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4805 conditions, 732 events. 381/732 cut-off events. For 6891/6891 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3285 event pairs, 184 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 4679. Up to 650 conditions per place. [2022-12-06 05:45:47,842 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 83 selfloop transitions, 16 changer transitions 1/100 dead transitions. [2022-12-06 05:45:47,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 100 transitions, 1582 flow [2022-12-06 05:45:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 05:45:47,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3275862068965517 [2022-12-06 05:45:47,843 INFO L175 Difference]: Start difference. First operand has 109 places, 95 transitions, 1351 flow. Second operand 4 states and 38 transitions. [2022-12-06 05:45:47,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 100 transitions, 1582 flow [2022-12-06 05:45:47,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 1398 flow, removed 20 selfloop flow, removed 15 redundant places. [2022-12-06 05:45:47,858 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 1154 flow [2022-12-06 05:45:47,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1154, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2022-12-06 05:45:47,858 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 05:45:47,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:47,859 INFO L89 Accepts]: Start accepts. Operand has 98 places, 93 transitions, 1154 flow [2022-12-06 05:45:47,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:47,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:47,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 1154 flow [2022-12-06 05:45:47,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 1154 flow [2022-12-06 05:45:47,880 INFO L130 PetriNetUnfolder]: 59/241 cut-off events. [2022-12-06 05:45:47,880 INFO L131 PetriNetUnfolder]: For 1485/1489 co-relation queries the response was YES. [2022-12-06 05:45:47,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 241 events. 59/241 cut-off events. For 1485/1489 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1245 event pairs, 1 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 1099. Up to 79 conditions per place. [2022-12-06 05:45:47,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 1154 flow [2022-12-06 05:45:47,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 05:45:47,882 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:47,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 05:45:47,883 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 1154 flow [2022-12-06 05:45:47,883 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:47,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:47,883 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:47,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:45:47,883 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:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash -659656618, now seen corresponding path program 1 times [2022-12-06 05:45:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:47,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147627214] [2022-12-06 05:45:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:48,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:48,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147627214] [2022-12-06 05:45:48,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147627214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:48,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054595935] [2022-12-06 05:45:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:48,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:48,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:48,700 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:45:48,705 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:45:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:48,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:45:48,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:48,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:48,842 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:45:48,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:48,916 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 05:45:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:48,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:49,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:49,049 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 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-06 05:45:49,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:49,100 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:45:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:50,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054595935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:50,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:50,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:45:50,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862143529] [2022-12-06 05:45:50,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:50,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:45:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:50,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:45:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:45:50,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:45:50,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 1154 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:50,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:45:50,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:50,935 INFO L130 PetriNetUnfolder]: 616/1167 cut-off events. [2022-12-06 05:45:50,936 INFO L131 PetriNetUnfolder]: For 8912/8912 co-relation queries the response was YES. [2022-12-06 05:45:50,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1167 events. 616/1167 cut-off events. For 8912/8912 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5943 event pairs, 81 based on Foata normal form. 4/1171 useless extension candidates. Maximal degree in co-relation 6221. Up to 638 conditions per place. [2022-12-06 05:45:50,943 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 99 selfloop transitions, 65 changer transitions 10/174 dead transitions. [2022-12-06 05:45:50,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 174 transitions, 2275 flow [2022-12-06 05:45:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:45:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:45:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-12-06 05:45:50,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2678062678062678 [2022-12-06 05:45:50,944 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 1154 flow. Second operand 13 states and 94 transitions. [2022-12-06 05:45:50,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 174 transitions, 2275 flow [2022-12-06 05:45:50,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 174 transitions, 2208 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:50,962 INFO L231 Difference]: Finished difference. Result has 111 places, 123 transitions, 1778 flow [2022-12-06 05:45:50,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1778, PETRI_PLACES=111, PETRI_TRANSITIONS=123} [2022-12-06 05:45:50,963 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 90 predicate places. [2022-12-06 05:45:50,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:50,963 INFO L89 Accepts]: Start accepts. Operand has 111 places, 123 transitions, 1778 flow [2022-12-06 05:45:50,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:50,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:50,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 123 transitions, 1778 flow [2022-12-06 05:45:50,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 123 transitions, 1778 flow [2022-12-06 05:45:50,994 INFO L130 PetriNetUnfolder]: 83/344 cut-off events. [2022-12-06 05:45:50,995 INFO L131 PetriNetUnfolder]: For 2292/2296 co-relation queries the response was YES. [2022-12-06 05:45:50,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 344 events. 83/344 cut-off events. For 2292/2296 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2075 event pairs, 1 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1780. Up to 131 conditions per place. [2022-12-06 05:45:50,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 123 transitions, 1778 flow [2022-12-06 05:45:50,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 05:45:51,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:52,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_347| v_~f~0.base_231))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_227 (* v_~x2~0_276 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_227 (* .cse4 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_227 (* .cse5 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_227 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_227 (* .cse2 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_172|) (< 3 (mod (* 3 v_~n~0_221) 4294967296)) (= (select .cse0 (+ v_~f~0.offset_227 (* .cse1 4))) v_~x2~0_274) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_186|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (< .cse1 v_~size~0_231) (<= 0 .cse1)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_251| 1) (= (ite (and (< v_~x1~0_369 v_~size~0_231) (<= 0 v_~x1~0_369)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_172| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_231)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_231)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_231)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_276 v_~size~0_231) (<= 0 v_~x2~0_276)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_231)) 1 0) 0)) (= v_~x1~0_368 (select .cse0 (+ v_~f~0.offset_227 (* v_~x1~0_369 4))))))))))) InVars {~x2~0=v_~x2~0_276, ~size~0=v_~size~0_231, ~f~0.base=v_~f~0.base_231, #memory_int=|v_#memory_int_347|, ~n~0=v_~n~0_221, ~x1~0=v_~x1~0_369, ~f~0.offset=v_~f~0.offset_227} OutVars{~x2~0=v_~x2~0_274, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_132|, ~size~0=v_~size~0_231, ~f~0.base=v_~f~0.base_231, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_104|, 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_186|, ~x1~0=v_~x1~0_368, ~f~0.offset=v_~f~0.offset_227, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_172|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_96|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_94|, #memory_int=|v_#memory_int_347|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_104|, ~n~0=v_~n~0_221, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_108|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_196|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:52,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_367| v_~f~0.base_251))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_247 (* v_~x2~0_325 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_247 (* .cse5 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_247 (* .cse3 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_247 (* .cse2 4))))) (let ((.cse1 (select .cse4 (+ (* .cse0 4) v_~f~0.offset_247)))) (and (not (= (ite (and (< .cse0 v_~size~0_251) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_251)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170|) (not (= (ite (and (< .cse2 v_~size~0_251) (<= 0 .cse2)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|) (= (ite (and (< v_~x1~0_409 v_~size~0_251) (<= 0 v_~x1~0_409)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (not (= (ite (and (< .cse3 v_~size~0_251) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216| 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_216| 4294967293) 4294967296) (mod (* 3 v_~n~0_241) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_251) (<= 0 v_~x2~0_325)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_247 (* v_~x1~0_409 4))) v_~x1~0_408) (= v_~x2~0_324 (select .cse4 (+ v_~f~0.offset_247 (* .cse1 4)))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_216|) (= |v_thread1Thread1of1ForFork0_~i~0#1_275| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_251)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, #memory_int=|v_#memory_int_367|, ~n~0=v_~n~0_241, ~x1~0=v_~x1~0_409, ~f~0.offset=v_~f~0.offset_247} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_162|, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, 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_170|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_216|, ~x1~0=v_~x1~0_408, ~f~0.offset=v_~f~0.offset_247, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_126|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_275|, #memory_int=|v_#memory_int_367|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_124|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_134|, ~n~0=v_~n~0_241, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_218|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_138|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:53,579 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [754] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_410| v_~f~0.base_285))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_281 (* v_~x2~0_398 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_281 (* .cse2 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_398) (< v_~x2~0_398 v_~size~0_285)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216| (ite (and (< .cse0 v_~size~0_285) (<= 0 .cse0)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248| 0)) (= v_~x2~0_397 (select .cse1 (+ v_~f~0.offset_281 (* .cse0 4)))) (not (= (ite (and (< .cse2 v_~size~0_285) (<= 0 .cse2)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_336| 1) |v_thread1Thread1of1ForFork0_~i~0#1_335|) (= v_~x1~0_486 (select .cse1 (+ v_~f~0.offset_281 (* v_~x1~0_487 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_263|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_336| 4294967296) (mod (* 3 v_~n~0_275) 4294967296)) (= (ite (and (<= 0 v_~x1~0_487) (< v_~x1~0_487 v_~size~0_285)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_263| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_274|))))) InVars {~x2~0=v_~x2~0_398, ~size~0=v_~size~0_285, ~f~0.base=v_~f~0.base_285, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_336|, #memory_int=|v_#memory_int_410|, ~n~0=v_~n~0_275, ~x1~0=v_~x1~0_487, ~f~0.offset=v_~f~0.offset_281} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_255|, ~x2~0=v_~x2~0_397, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_208|, ~size~0=v_~size~0_285, ~f~0.base=v_~f~0.base_285, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_180|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_274|, ~x1~0=v_~x1~0_486, ~f~0.offset=v_~f~0.offset_281, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_335|, #memory_int=|v_#memory_int_410|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_263|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_170|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_180|, ~n~0=v_~n~0_275, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_265|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_184|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:54,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_367| v_~f~0.base_251))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_247 (* v_~x2~0_325 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_247 (* .cse5 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_247 (* .cse3 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_247 (* .cse2 4))))) (let ((.cse1 (select .cse4 (+ (* .cse0 4) v_~f~0.offset_247)))) (and (not (= (ite (and (< .cse0 v_~size~0_251) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_251)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170|) (not (= (ite (and (< .cse2 v_~size~0_251) (<= 0 .cse2)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|) (= (ite (and (< v_~x1~0_409 v_~size~0_251) (<= 0 v_~x1~0_409)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (not (= (ite (and (< .cse3 v_~size~0_251) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216| 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_216| 4294967293) 4294967296) (mod (* 3 v_~n~0_241) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_251) (<= 0 v_~x2~0_325)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_247 (* v_~x1~0_409 4))) v_~x1~0_408) (= v_~x2~0_324 (select .cse4 (+ v_~f~0.offset_247 (* .cse1 4)))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_216|) (= |v_thread1Thread1of1ForFork0_~i~0#1_275| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_251)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, #memory_int=|v_#memory_int_367|, ~n~0=v_~n~0_241, ~x1~0=v_~x1~0_409, ~f~0.offset=v_~f~0.offset_247} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_162|, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, 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_170|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_216|, ~x1~0=v_~x1~0_408, ~f~0.offset=v_~f~0.offset_247, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_126|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_275|, #memory_int=|v_#memory_int_367|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_124|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_134|, ~n~0=v_~n~0_241, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_218|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_138|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, 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:45:54,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_426| v_~f~0.base_301))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_297 (* v_~x2~0_438 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_297 (* .cse4 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_297 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_297 (* .cse6 4))))) (let ((.cse0 (mod (* 3 v_~n~0_291) 4294967296)) (.cse2 (select .cse1 (+ (* .cse5 4) v_~f~0.offset_297)))) (and (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_62|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_62| 0) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967293) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272| 0)) (= v_~x1~0_520 (select .cse1 (+ v_~f~0.offset_297 (* v_~x1~0_521 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| (ite (and (< .cse2 v_~size~0_301) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_301)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_301)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| (ite (and (<= 0 v_~x1~0_521) (< v_~x1~0_521 v_~size~0_301)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_298|) (not (= 0 (ite (and (< .cse5 v_~size~0_301) (<= 0 .cse5)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_297 (* .cse2 4))) v_~x2~0_437) (= |v_thread1Thread1of1ForFork0_~i~0#1_361| 1) (not (= (ite (and (< v_~x2~0_438 v_~size~0_301) (<= 0 v_~x2~0_438)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|)))))))) InVars {~x2~0=v_~x2~0_438, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, #memory_int=|v_#memory_int_426|, ~n~0=v_~n~0_291, ~x1~0=v_~x1~0_521, ~f~0.offset=v_~f~0.offset_297} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_275|, ~x2~0=v_~x2~0_437, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_232|, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_62|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_298|, ~x1~0=v_~x1~0_520, ~f~0.offset=v_~f~0.offset_297, 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_267|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_62|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_196|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_361|, #memory_int=|v_#memory_int_426|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_194|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_204|, ~n~0=v_~n~0_291, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_285|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_208|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, 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, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:55,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_426| v_~f~0.base_301))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_297 (* v_~x2~0_438 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_297 (* .cse4 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_297 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_297 (* .cse6 4))))) (let ((.cse0 (mod (* 3 v_~n~0_291) 4294967296)) (.cse2 (select .cse1 (+ (* .cse5 4) v_~f~0.offset_297)))) (and (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_62|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_62| 0) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967293) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272| 0)) (= v_~x1~0_520 (select .cse1 (+ v_~f~0.offset_297 (* v_~x1~0_521 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| (ite (and (< .cse2 v_~size~0_301) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_301)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_301)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| (ite (and (<= 0 v_~x1~0_521) (< v_~x1~0_521 v_~size~0_301)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_298|) (not (= 0 (ite (and (< .cse5 v_~size~0_301) (<= 0 .cse5)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_297 (* .cse2 4))) v_~x2~0_437) (= |v_thread1Thread1of1ForFork0_~i~0#1_361| 1) (not (= (ite (and (< v_~x2~0_438 v_~size~0_301) (<= 0 v_~x2~0_438)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|)))))))) InVars {~x2~0=v_~x2~0_438, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, #memory_int=|v_#memory_int_426|, ~n~0=v_~n~0_291, ~x1~0=v_~x1~0_521, ~f~0.offset=v_~f~0.offset_297} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_275|, ~x2~0=v_~x2~0_437, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_232|, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_62|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_298|, ~x1~0=v_~x1~0_520, ~f~0.offset=v_~f~0.offset_297, 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_267|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_62|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_196|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_361|, #memory_int=|v_#memory_int_426|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_194|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_204|, ~n~0=v_~n~0_291, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_285|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_208|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, 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, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:55,556 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 05:45:55,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4593 [2022-12-06 05:45:55,556 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 124 transitions, 1931 flow [2022-12-06 05:45:55,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:55,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:55,561 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:45:55,757 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,SelfDestructingSolverStorable33 [2022-12-06 05:45:55,757 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:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash -272959584, now seen corresponding path program 1 times [2022-12-06 05:45:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:55,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999651262] [2022-12-06 05:45:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:55,833 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,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:55,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999651262] [2022-12-06 05:45:55,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999651262] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:55,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570091531] [2022-12-06 05:45:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:55,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:55,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:55,853 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:45:55,856 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:45:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:55,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:45:55,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:56,018 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:56,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:56,038 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:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570091531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:56,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:45:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451194929] [2022-12-06 05:45:56,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:56,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:45:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:56,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:45:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:45:56,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:45:56,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 124 transitions, 1931 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:56,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:56,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:45:56,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:56,397 INFO L130 PetriNetUnfolder]: 600/1133 cut-off events. [2022-12-06 05:45:56,397 INFO L131 PetriNetUnfolder]: For 11918/11918 co-relation queries the response was YES. [2022-12-06 05:45:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1133 events. 600/1133 cut-off events. For 11918/11918 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5598 event pairs, 283 based on Foata normal form. 22/1155 useless extension candidates. Maximal degree in co-relation 7159. Up to 985 conditions per place. [2022-12-06 05:45:56,406 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 106 selfloop transitions, 11 changer transitions 24/141 dead transitions. [2022-12-06 05:45:56,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 141 transitions, 2446 flow [2022-12-06 05:45:56,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-06 05:45:56,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24537037037037038 [2022-12-06 05:45:56,407 INFO L175 Difference]: Start difference. First operand has 111 places, 124 transitions, 1931 flow. Second operand 6 states and 53 transitions. [2022-12-06 05:45:56,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 141 transitions, 2446 flow [2022-12-06 05:45:56,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 141 transitions, 2063 flow, removed 169 selfloop flow, removed 8 redundant places. [2022-12-06 05:45:56,442 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 1355 flow [2022-12-06 05:45:56,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1355, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2022-12-06 05:45:56,442 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 05:45:56,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:56,442 INFO L89 Accepts]: Start accepts. Operand has 109 places, 109 transitions, 1355 flow [2022-12-06 05:45:56,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:56,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:56,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 109 transitions, 1355 flow [2022-12-06 05:45:56,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 109 transitions, 1355 flow [2022-12-06 05:45:56,482 INFO L130 PetriNetUnfolder]: 79/310 cut-off events. [2022-12-06 05:45:56,483 INFO L131 PetriNetUnfolder]: For 1670/1674 co-relation queries the response was YES. [2022-12-06 05:45:56,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 310 events. 79/310 cut-off events. For 1670/1674 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1730 event pairs, 1 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 1458. Up to 104 conditions per place. [2022-12-06 05:45:56,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 109 transitions, 1355 flow [2022-12-06 05:45:56,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 05:45:56,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_369| v_~f~0.base_253))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_249 (* v_~x2~0_330 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_249 (* .cse1 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_249 (* .cse7 4))))) (let ((.cse0 (select .cse8 (+ (* .cse3 4) v_~f~0.offset_249)))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_249 (* .cse0 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_249 (* .cse6 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_249 (* .cse4 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_249 (* .cse2 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_253)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_253)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_253) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_253)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_218|) (not (= (ite (and (< .cse4 v_~size~0_253) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_330) (< v_~x2~0_330 v_~size~0_253)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_253)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_253) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_253) (<= 0 .cse7)) 1 0) 0)) (= (select .cse8 (+ (* 4 .cse5) v_~f~0.offset_249)) v_~x2~0_328) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_218| 4294967293) 4294967296) (mod (* 3 v_~n~0_243) 4294967296)))))))))))) InVars {~x2~0=v_~x2~0_330, ~size~0=v_~size~0_253, ~f~0.base=v_~f~0.base_253, #memory_int=|v_#memory_int_369|, ~n~0=v_~n~0_243, ~f~0.offset=v_~f~0.offset_249} OutVars{~x2~0=v_~x2~0_328, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_253, ~f~0.base=v_~f~0.base_253, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_136|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_218|, ~f~0.offset=v_~f~0.offset_249, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_128|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_126|, #memory_int=|v_#memory_int_369|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_136|, ~n~0=v_~n~0_243, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_140|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:58,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:58,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1740 [2022-12-06 05:45:58,183 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 109 transitions, 1369 flow [2022-12-06 05:45:58,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:58,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:58,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:58,188 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:45:58,383 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,SelfDestructingSolverStorable34 [2022-12-06 05:45:58,383 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:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash 731794055, now seen corresponding path program 1 times [2022-12-06 05:45:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:58,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839685343] [2022-12-06 05:45:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:58,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:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:58,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839685343] [2022-12-06 05:45:58,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839685343] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:58,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146798039] [2022-12-06 05:45:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:58,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:58,480 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:45:58,511 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:45:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:58,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:45:58,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:58,719 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:58,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:58,925 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:58,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146798039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:58,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:58,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-12-06 05:45:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336478092] [2022-12-06 05:45:58,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:58,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:45:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:58,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:45:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:45:58,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:45:58,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 109 transitions, 1369 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:58,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:58,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:45:58,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:59,291 INFO L130 PetriNetUnfolder]: 573/1080 cut-off events. [2022-12-06 05:45:59,291 INFO L131 PetriNetUnfolder]: For 7805/7805 co-relation queries the response was YES. [2022-12-06 05:45:59,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6633 conditions, 1080 events. 573/1080 cut-off events. For 7805/7805 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5276 event pairs, 243 based on Foata normal form. 14/1094 useless extension candidates. Maximal degree in co-relation 5934. Up to 893 conditions per place. [2022-12-06 05:45:59,299 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 82 selfloop transitions, 50 changer transitions 17/149 dead transitions. [2022-12-06 05:45:59,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 149 transitions, 2058 flow [2022-12-06 05:45:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:45:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:45:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-12-06 05:45:59,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19623655913978494 [2022-12-06 05:45:59,300 INFO L175 Difference]: Start difference. First operand has 97 places, 109 transitions, 1369 flow. Second operand 12 states and 73 transitions. [2022-12-06 05:45:59,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 149 transitions, 2058 flow [2022-12-06 05:45:59,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 149 transitions, 1884 flow, removed 45 selfloop flow, removed 10 redundant places. [2022-12-06 05:45:59,330 INFO L231 Difference]: Finished difference. Result has 105 places, 118 transitions, 1487 flow [2022-12-06 05:45:59,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1487, PETRI_PLACES=105, PETRI_TRANSITIONS=118} [2022-12-06 05:45:59,331 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 05:45:59,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:59,331 INFO L89 Accepts]: Start accepts. Operand has 105 places, 118 transitions, 1487 flow [2022-12-06 05:45:59,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:59,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:59,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 118 transitions, 1487 flow [2022-12-06 05:45:59,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 118 transitions, 1487 flow [2022-12-06 05:45:59,387 INFO L130 PetriNetUnfolder]: 92/342 cut-off events. [2022-12-06 05:45:59,387 INFO L131 PetriNetUnfolder]: For 2588/2605 co-relation queries the response was YES. [2022-12-06 05:45:59,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 342 events. 92/342 cut-off events. For 2588/2605 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1963 event pairs, 8 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 1861. Up to 91 conditions per place. [2022-12-06 05:45:59,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 118 transitions, 1487 flow [2022-12-06 05:45:59,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 05:45:59,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:59,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:45:59,723 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:59,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-06 05:45:59,724 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 116 transitions, 1488 flow [2022-12-06 05:45:59,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:59,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:59,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:59,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:59,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:59,925 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:45:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1817371637, now seen corresponding path program 1 times [2022-12-06 05:45:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262223918] [2022-12-06 05:45:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:59,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:00,058 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:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262223918] [2022-12-06 05:46:00,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262223918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:00,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559214255] [2022-12-06 05:46:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:00,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:00,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:00,073 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:46:00,074 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:46:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:00,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:46:00,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:00,194 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:00,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:46:00,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559214255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:00,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:46:00,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-12-06 05:46:00,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125694949] [2022-12-06 05:46:00,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:00,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:46:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:00,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:46:00,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:46:00,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:46:00,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 116 transitions, 1488 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:00,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:00,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:46:00,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:00,432 INFO L130 PetriNetUnfolder]: 553/1041 cut-off events. [2022-12-06 05:46:00,432 INFO L131 PetriNetUnfolder]: For 8965/8965 co-relation queries the response was YES. [2022-12-06 05:46:00,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6886 conditions, 1041 events. 553/1041 cut-off events. For 8965/8965 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5002 event pairs, 233 based on Foata normal form. 4/1045 useless extension candidates. Maximal degree in co-relation 6381. Up to 907 conditions per place. [2022-12-06 05:46:00,438 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 89 selfloop transitions, 35 changer transitions 8/132 dead transitions. [2022-12-06 05:46:00,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 1914 flow [2022-12-06 05:46:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 05:46:00,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2022-12-06 05:46:00,439 INFO L175 Difference]: Start difference. First operand has 99 places, 116 transitions, 1488 flow. Second operand 5 states and 51 transitions. [2022-12-06 05:46:00,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 1914 flow [2022-12-06 05:46:00,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 132 transitions, 1796 flow, removed 53 selfloop flow, removed 7 redundant places. [2022-12-06 05:46:00,458 INFO L231 Difference]: Finished difference. Result has 98 places, 117 transitions, 1487 flow [2022-12-06 05:46:00,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1487, PETRI_PLACES=98, PETRI_TRANSITIONS=117} [2022-12-06 05:46:00,459 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 05:46:00,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:00,459 INFO L89 Accepts]: Start accepts. Operand has 98 places, 117 transitions, 1487 flow [2022-12-06 05:46:00,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:00,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:00,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 117 transitions, 1487 flow [2022-12-06 05:46:00,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 117 transitions, 1487 flow [2022-12-06 05:46:00,488 INFO L130 PetriNetUnfolder]: 93/340 cut-off events. [2022-12-06 05:46:00,489 INFO L131 PetriNetUnfolder]: For 2362/2392 co-relation queries the response was YES. [2022-12-06 05:46:00,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 340 events. 93/340 cut-off events. For 2362/2392 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1929 event pairs, 8 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 1871. Up to 89 conditions per place. [2022-12-06 05:46:00,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 117 transitions, 1487 flow [2022-12-06 05:46:00,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 05:46:00,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_424| v_~f~0.base_299))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_295 (* v_~x2~0_434 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_295 (* v_~x1~0_516 4)))) (.cse1 (mod (* 3 v_~n~0_289) 4294967296)) (.cse4 (select .cse2 (+ v_~f~0.offset_295 (* .cse3 4))))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_299)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_263|) (= |v_thread1Thread1of1ForFork0_~i~0#1_355| (+ |v_thread1Thread1of1ForFork0_~i~0#1_357| 2)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_355| 4294967295) 4294967296) .cse1) (not (= (ite (and (<= 0 v_~x2~0_434) (< v_~x2~0_434 v_~size~0_299)) 1 0) 0)) (= v_~x1~0_514 (select .cse2 (+ v_~f~0.offset_295 (* .cse0 4)))) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_299)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_263| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_279|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_296|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_357| 4294967296) .cse1) (= v_~x2~0_433 (select .cse2 (+ v_~f~0.offset_295 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_299)) 1 0)) (not (= (ite (and (< v_~x1~0_516 v_~size~0_299) (<= 0 v_~x1~0_516)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_279| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270| 0)))))) InVars {~x2~0=v_~x2~0_434, ~size~0=v_~size~0_299, ~f~0.base=v_~f~0.base_299, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_357|, #memory_int=|v_#memory_int_424|, ~n~0=v_~n~0_289, ~x1~0=v_~x1~0_516, ~f~0.offset=v_~f~0.offset_295} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_271|, ~x2~0=v_~x2~0_433, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_230|, ~size~0=v_~size~0_299, ~f~0.base=v_~f~0.base_299, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_202|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_296|, ~x1~0=v_~x1~0_514, ~f~0.offset=v_~f~0.offset_295, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_263|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_355|, #memory_int=|v_#memory_int_424|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_279|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_192|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_202|, ~n~0=v_~n~0_289, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_281|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_206|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:46:00,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:00,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 416 [2022-12-06 05:46:00,875 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 116 transitions, 1479 flow [2022-12-06 05:46:00,875 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:00,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:00,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:00,882 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:46:01,076 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,SelfDestructingSolverStorable36 [2022-12-06 05:46:01,076 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:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash -47925937, now seen corresponding path program 1 times [2022-12-06 05:46:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:01,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45098075] [2022-12-06 05:46:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:01,134 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:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:01,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45098075] [2022-12-06 05:46:01,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45098075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:01,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:01,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:46:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527140572] [2022-12-06 05:46:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:01,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:46:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:01,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:46:01,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:46:01,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:46:01,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 116 transitions, 1479 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:46:01,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:01,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:46:01,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:01,339 INFO L130 PetriNetUnfolder]: 552/1037 cut-off events. [2022-12-06 05:46:01,339 INFO L131 PetriNetUnfolder]: For 8522/8522 co-relation queries the response was YES. [2022-12-06 05:46:01,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 1037 events. 552/1037 cut-off events. For 8522/8522 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4968 event pairs, 125 based on Foata normal form. 6/1043 useless extension candidates. Maximal degree in co-relation 6555. Up to 833 conditions per place. [2022-12-06 05:46:01,345 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 84 selfloop transitions, 45 changer transitions 2/131 dead transitions. [2022-12-06 05:46:01,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 131 transitions, 1897 flow [2022-12-06 05:46:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 05:46:01,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.296969696969697 [2022-12-06 05:46:01,346 INFO L175 Difference]: Start difference. First operand has 96 places, 116 transitions, 1479 flow. Second operand 5 states and 49 transitions. [2022-12-06 05:46:01,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 131 transitions, 1897 flow [2022-12-06 05:46:01,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 1815 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:01,362 INFO L231 Difference]: Finished difference. Result has 98 places, 115 transitions, 1499 flow [2022-12-06 05:46:01,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1499, PETRI_PLACES=98, PETRI_TRANSITIONS=115} [2022-12-06 05:46:01,363 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 05:46:01,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:01,363 INFO L89 Accepts]: Start accepts. Operand has 98 places, 115 transitions, 1499 flow [2022-12-06 05:46:01,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:01,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:01,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 115 transitions, 1499 flow [2022-12-06 05:46:01,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 115 transitions, 1499 flow [2022-12-06 05:46:01,394 INFO L130 PetriNetUnfolder]: 93/340 cut-off events. [2022-12-06 05:46:01,395 INFO L131 PetriNetUnfolder]: For 2547/2577 co-relation queries the response was YES. [2022-12-06 05:46:01,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 340 events. 93/340 cut-off events. For 2547/2577 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1926 event pairs, 8 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 1679. Up to 91 conditions per place. [2022-12-06 05:46:01,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 115 transitions, 1499 flow [2022-12-06 05:46:01,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 05:46:01,399 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:01,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 05:46:01,400 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 115 transitions, 1499 flow [2022-12-06 05:46:01,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:46:01,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:01,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:01,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 05:46:01,400 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:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:01,401 INFO L85 PathProgramCache]: Analyzing trace with hash 938567221, now seen corresponding path program 1 times [2022-12-06 05:46:01,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:01,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216594275] [2022-12-06 05:46:01,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:01,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:01,479 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:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216594275] [2022-12-06 05:46:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216594275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060158352] [2022-12-06 05:46:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:01,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:01,485 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:46:01,509 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:46:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:01,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:46:01,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:01,731 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:01,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:01,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:46:01,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060158352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:01,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:01,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 05:46:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145235676] [2022-12-06 05:46:01,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:01,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:46:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:46:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:46:01,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:46:01,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 1499 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:01,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:01,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:46:01,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:02,471 INFO L130 PetriNetUnfolder]: 533/1005 cut-off events. [2022-12-06 05:46:02,471 INFO L131 PetriNetUnfolder]: For 8678/8678 co-relation queries the response was YES. [2022-12-06 05:46:02,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6661 conditions, 1005 events. 533/1005 cut-off events. For 8678/8678 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4790 event pairs, 117 based on Foata normal form. 20/1025 useless extension candidates. Maximal degree in co-relation 5746. Up to 657 conditions per place. [2022-12-06 05:46:02,477 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 66 selfloop transitions, 26 changer transitions 51/143 dead transitions. [2022-12-06 05:46:02,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 143 transitions, 2071 flow [2022-12-06 05:46:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:46:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:46:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-12-06 05:46:02,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22983870967741934 [2022-12-06 05:46:02,479 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 1499 flow. Second operand 8 states and 57 transitions. [2022-12-06 05:46:02,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 143 transitions, 2071 flow [2022-12-06 05:46:02,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 2000 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:02,496 INFO L231 Difference]: Finished difference. Result has 103 places, 80 transitions, 877 flow [2022-12-06 05:46:02,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=877, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2022-12-06 05:46:02,497 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 05:46:02,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:02,497 INFO L89 Accepts]: Start accepts. Operand has 103 places, 80 transitions, 877 flow [2022-12-06 05:46:02,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:02,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:02,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 80 transitions, 877 flow [2022-12-06 05:46:02,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 80 transitions, 877 flow [2022-12-06 05:46:02,519 INFO L130 PetriNetUnfolder]: 58/251 cut-off events. [2022-12-06 05:46:02,519 INFO L131 PetriNetUnfolder]: For 1578/1609 co-relation queries the response was YES. [2022-12-06 05:46:02,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 251 events. 58/251 cut-off events. For 1578/1609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1360 event pairs, 7 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 1218. Up to 65 conditions per place. [2022-12-06 05:46:02,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 80 transitions, 877 flow [2022-12-06 05:46:02,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 05:46:02,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:02,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 05:46:02,628 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 863 flow [2022-12-06 05:46:02,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:02,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:02,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:02,635 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:46:02,833 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,SelfDestructingSolverStorable38 [2022-12-06 05:46:02,833 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:46:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -999707263, now seen corresponding path program 1 times [2022-12-06 05:46:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:02,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646591427] [2022-12-06 05:46:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:02,969 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:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:02,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646591427] [2022-12-06 05:46:02,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646591427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:02,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553698283] [2022-12-06 05:46:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:02,971 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:46:02,973 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:46:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:03,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 05:46:03,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:03,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:03,095 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:03,099 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:03,120 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:03,519 INFO L321 Elim1Store]: treesize reduction 259, result has 10.4 percent of original size [2022-12-06 05:46:03,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 17 new quantified variables, introduced 36 case distinctions, treesize of input 115 treesize of output 88 [2022-12-06 05:46:03,555 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:03,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:04,392 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:04,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553698283] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:04,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:04,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 05:46:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225292893] [2022-12-06 05:46:04,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:46:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:46:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=193, Unknown=1, NotChecked=0, Total=240 [2022-12-06 05:46:04,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:46:04,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 863 flow. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:04,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:04,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:46:04,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:13,337 WARN L233 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:40,751 WARN L233 SmtUtils]: Spent 26.80s on a formula simplification. DAG size of input: 178 DAG size of output: 175 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:40,962 INFO L130 PetriNetUnfolder]: 422/813 cut-off events. [2022-12-06 05:46:40,962 INFO L131 PetriNetUnfolder]: For 5891/5891 co-relation queries the response was YES. [2022-12-06 05:46:40,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 813 events. 422/813 cut-off events. For 5891/5891 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3754 event pairs, 103 based on Foata normal form. 2/815 useless extension candidates. Maximal degree in co-relation 4751. Up to 616 conditions per place. [2022-12-06 05:46:40,966 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 95 selfloop transitions, 18 changer transitions 7/120 dead transitions. [2022-12-06 05:46:40,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 120 transitions, 1446 flow [2022-12-06 05:46:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:46:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:46:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-12-06 05:46:40,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-06 05:46:40,967 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 863 flow. Second operand 13 states and 72 transitions. [2022-12-06 05:46:40,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 120 transitions, 1446 flow [2022-12-06 05:46:40,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 1271 flow, removed 35 selfloop flow, removed 16 redundant places. [2022-12-06 05:46:40,978 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 842 flow [2022-12-06 05:46:40,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=842, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2022-12-06 05:46:40,978 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 05:46:40,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:40,978 INFO L89 Accepts]: Start accepts. Operand has 91 places, 83 transitions, 842 flow [2022-12-06 05:46:40,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:40,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:40,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 83 transitions, 842 flow [2022-12-06 05:46:40,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 842 flow [2022-12-06 05:46:40,999 INFO L130 PetriNetUnfolder]: 59/250 cut-off events. [2022-12-06 05:46:40,999 INFO L131 PetriNetUnfolder]: For 1352/1375 co-relation queries the response was YES. [2022-12-06 05:46:41,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 250 events. 59/250 cut-off events. For 1352/1375 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1366 event pairs, 7 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 1032. Up to 67 conditions per place. [2022-12-06 05:46:41,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 842 flow [2022-12-06 05:46:41,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 05:46:41,005 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:46:42,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_434| v_~f~0.base_309))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_305 (* v_~x2~0_456 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_305 (* .cse1 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_305 (* .cse7 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_305 (* .cse0 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_305 (* .cse10 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_305 (* .cse8 4))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_305 (* 4 .cse2))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_305 (* .cse9 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_305 (* .cse6 4))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_305 (* .cse5 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_305 (* .cse11 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_309) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_307| 12) (not (= (ite (and (< .cse1 v_~size~0_309) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_309)) 1 0))) (= v_~x2~0_454 (select .cse3 (+ v_~f~0.offset_305 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_309)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_309)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_456 v_~size~0_309) (<= 0 v_~x2~0_456)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_309)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_307| 4294967293) 4294967296) (mod (* 3 v_~n~0_299) 4294967296)) (not (= (ite (and (< .cse7 v_~size~0_309) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_309) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_309)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_309)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_309)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_456, ~size~0=v_~size~0_309, ~f~0.base=v_~f~0.base_309, #memory_int=|v_#memory_int_434|, ~n~0=v_~n~0_299, ~f~0.offset=v_~f~0.offset_305} OutVars{~x2~0=v_~x2~0_454, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_241|, ~size~0=v_~size~0_309, ~f~0.base=v_~f~0.base_309, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_213|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_307|, ~f~0.offset=v_~f~0.offset_305, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_205|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_203|, #memory_int=|v_#memory_int_434|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_213|, ~n~0=v_~n~0_299, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_217|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:46:43,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:46:44,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:46:44,255 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:46:44,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3278 [2022-12-06 05:46:44,256 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 908 flow [2022-12-06 05:46:44,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:44,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:44,256 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:44,262 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:46:44,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 05:46:44,462 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:46:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash -626596837, now seen corresponding path program 1 times [2022-12-06 05:46:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:44,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877769846] [2022-12-06 05:46:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877769846] [2022-12-06 05:46:44,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877769846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172735225] [2022-12-06 05:46:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:44,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:44,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:44,612 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:46:44,614 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:46:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:44,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:46:44,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:45,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:45,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172735225] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:45,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:45,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 05:46:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388280866] [2022-12-06 05:46:45,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:46:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:46:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:46:45,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:46:45,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 908 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:46:45,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:45,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:46:45,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:45,288 INFO L130 PetriNetUnfolder]: 405/774 cut-off events. [2022-12-06 05:46:45,288 INFO L131 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2022-12-06 05:46:45,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 774 events. 405/774 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3462 event pairs, 213 based on Foata normal form. 12/786 useless extension candidates. Maximal degree in co-relation 4100. Up to 725 conditions per place. [2022-12-06 05:46:45,294 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 79 selfloop transitions, 0 changer transitions 16/95 dead transitions. [2022-12-06 05:46:45,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 1228 flow [2022-12-06 05:46:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:46:45,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2022-12-06 05:46:45,295 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 908 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:46:45,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 1228 flow [2022-12-06 05:46:45,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 1093 flow, removed 47 selfloop flow, removed 7 redundant places. [2022-12-06 05:46:45,311 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 742 flow [2022-12-06 05:46:45,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=742, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2022-12-06 05:46:45,312 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2022-12-06 05:46:45,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:45,312 INFO L89 Accepts]: Start accepts. Operand has 87 places, 79 transitions, 742 flow [2022-12-06 05:46:45,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:45,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:45,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 79 transitions, 742 flow [2022-12-06 05:46:45,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 79 transitions, 742 flow [2022-12-06 05:46:45,341 INFO L130 PetriNetUnfolder]: 55/231 cut-off events. [2022-12-06 05:46:45,341 INFO L131 PetriNetUnfolder]: For 1048/1067 co-relation queries the response was YES. [2022-12-06 05:46:45,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 231 events. 55/231 cut-off events. For 1048/1067 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1188 event pairs, 4 based on Foata normal form. 3/228 useless extension candidates. Maximal degree in co-relation 993. Up to 66 conditions per place. [2022-12-06 05:46:45,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 79 transitions, 742 flow [2022-12-06 05:46:45,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 05:46:45,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:45,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 05:46:45,462 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 736 flow [2022-12-06 05:46:45,463 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:46:45,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:45,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:45,469 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:46:45,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:45,669 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:46:45,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1832882375, now seen corresponding path program 1 times [2022-12-06 05:46:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:45,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620393045] [2022-12-06 05:46:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:45,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:45,727 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:45,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:45,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620393045] [2022-12-06 05:46:45,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620393045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:45,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759351964] [2022-12-06 05:46:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:45,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:45,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:45,728 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:46:45,732 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:46:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:45,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-06 05:46:45,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:45,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:45,867 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:45,870 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:45,900 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:47,167 INFO L321 Elim1Store]: treesize reduction 793, result has 5.7 percent of original size [2022-12-06 05:46:47,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 29 new quantified variables, introduced 105 case distinctions, treesize of input 151 treesize of output 136 [2022-12-06 05:46:47,221 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:47,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:49,061 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:49,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759351964] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:49,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:49,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 05:46:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075962589] [2022-12-06 05:46:49,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:49,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:46:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:46:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=166, Unknown=1, NotChecked=0, Total=210 [2022-12-06 05:46:49,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:46:49,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 736 flow. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:49,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:49,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:46:49,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:31,500 WARN L233 SmtUtils]: Spent 41.17s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:48:11,217 WARN L233 SmtUtils]: Spent 38.76s on a formula simplification. DAG size of input: 256 DAG size of output: 253 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:48:12,676 INFO L130 PetriNetUnfolder]: 401/758 cut-off events. [2022-12-06 05:48:12,676 INFO L131 PetriNetUnfolder]: For 3984/3984 co-relation queries the response was YES. [2022-12-06 05:48:12,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 758 events. 401/758 cut-off events. For 3984/3984 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3325 event pairs, 95 based on Foata normal form. 4/762 useless extension candidates. Maximal degree in co-relation 4220. Up to 629 conditions per place. [2022-12-06 05:48:12,679 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 91 selfloop transitions, 20 changer transitions 9/120 dead transitions. [2022-12-06 05:48:12,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 120 transitions, 1331 flow [2022-12-06 05:48:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:48:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:48:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-12-06 05:48:12,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-06 05:48:12,681 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 736 flow. Second operand 14 states and 77 transitions. [2022-12-06 05:48:12,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 120 transitions, 1331 flow [2022-12-06 05:48:12,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 1290 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-06 05:48:12,689 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 874 flow [2022-12-06 05:48:12,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=874, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-12-06 05:48:12,690 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 05:48:12,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:12,690 INFO L89 Accepts]: Start accepts. Operand has 94 places, 87 transitions, 874 flow [2022-12-06 05:48:12,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:12,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:12,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 87 transitions, 874 flow [2022-12-06 05:48:12,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 874 flow [2022-12-06 05:48:12,710 INFO L130 PetriNetUnfolder]: 59/235 cut-off events. [2022-12-06 05:48:12,711 INFO L131 PetriNetUnfolder]: For 1212/1231 co-relation queries the response was YES. [2022-12-06 05:48:12,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 235 events. 59/235 cut-off events. For 1212/1231 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1180 event pairs, 4 based on Foata normal form. 3/232 useless extension candidates. Maximal degree in co-relation 1058. Up to 72 conditions per place. [2022-12-06 05:48:12,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 874 flow [2022-12-06 05:48:12,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 05:48:13,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:19,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [787] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_455| v_~f~0.base_325))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_321 (* v_~x2~0_476 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_321 (* 4 .cse6))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_321 (* .cse8 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_321 (* .cse10 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_321 (* .cse2 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_321 (* 4 .cse0))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_321 (* .cse5 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_321 (* 4 .cse11))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_321 (* .cse7 4))))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_321 (* .cse9 4))))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_321 (* .cse12 4))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_321 (* .cse13 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_321 (* .cse14 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_321 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_297|) (not (= (ite (and (< .cse0 v_~size~0_325) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_325) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_325) (<= 0 .cse2)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_297| 0)) (= (select .cse3 (+ v_~f~0.offset_321 (* .cse4 4))) v_~x2~0_474) (< 12 (mod (* 3 v_~n~0_315) 4294967296)) (not (= (ite (and (< .cse5 v_~size~0_325) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_325) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_325)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_325) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_332| 15) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_325)) 1 0))) (not (= (ite (and (< .cse10 v_~size~0_325) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_325)) 1 0) 0)) (= (ite (and (< .cse4 v_~size~0_325) (<= 0 .cse4)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265|) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_325)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_325) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_325)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_476 v_~size~0_325) (<= 0 v_~x2~0_476)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_476, ~size~0=v_~size~0_325, ~f~0.base=v_~f~0.base_325, #memory_int=|v_#memory_int_455|, ~n~0=v_~n~0_315, ~f~0.offset=v_~f~0.offset_321} OutVars{~x2~0=v_~x2~0_474, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_257|, ~size~0=v_~size~0_325, ~f~0.base=v_~f~0.base_325, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_229|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_332|, ~f~0.offset=v_~f~0.offset_321, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_297|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_221|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_219|, #memory_int=|v_#memory_int_455|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_229|, ~n~0=v_~n~0_315, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_233|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:20,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_480| v_~f~0.base_347))) (let ((.cse9 (select .cse4 (+ (* v_~x2~0_530 4) v_~f~0.offset_343)))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_343 (* .cse9 4))))) (let ((.cse12 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse7))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_343 (* .cse12 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_343 (* .cse14 4))))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse1))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_343 (* .cse11 4))))) (let ((.cse13 (select .cse4 (+ v_~f~0.offset_343 (* .cse3 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_343 (* .cse13 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_343 (* .cse8 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse10))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse6))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_343 (* .cse0 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_343 (* .cse5 4))))) (and (= (ite (and (< v_~x1~0_620 v_~size~0_347) (<= 0 v_~x1~0_620)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330|) (not (= (ite (and (< .cse0 v_~size~0_347) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_347) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_347)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_347) (<= 0 .cse3)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse2))) v_~x2~0_529) (< 12 (mod (* 3 v_~n~0_337) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_444| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_347)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_343 (* v_~x1~0_620 4))) v_~x1~0_619) (not (= (ite (and (<= 0 v_~x2~0_530) (< v_~x2~0_530 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_347) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_347)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332| 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_347) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_347)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_347) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_347) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_373| 15))))))))))))))))) InVars {~x2~0=v_~x2~0_530, ~size~0=v_~size~0_347, ~f~0.base=v_~f~0.base_347, #memory_int=|v_#memory_int_480|, ~n~0=v_~n~0_337, ~x1~0=v_~x1~0_620, ~f~0.offset=v_~f~0.offset_343} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_338|, ~x2~0=v_~x2~0_529, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_292|, ~size~0=v_~size~0_347, ~f~0.base=v_~f~0.base_347, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_264|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_373|, ~x1~0=v_~x1~0_619, ~f~0.offset=v_~f~0.offset_343, 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_330|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_256|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_444|, #memory_int=|v_#memory_int_480|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_254|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_264|, ~n~0=v_~n~0_337, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_348|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_268|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:26,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_482| v_~f~0.base_349))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_345 (* v_~x2~0_535 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_345 (* .cse12 4))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_345 (* .cse10 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_345 (* .cse11 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_345 (* 4 .cse6))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_345 (* .cse1 4))))) (let ((.cse16 (select .cse3 (+ (* .cse14 4) v_~f~0.offset_345)))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_345 (* .cse16 4))))) (let ((.cse15 (select .cse3 (+ v_~f~0.offset_345 (* .cse5 4))))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_345 (* .cse15 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_345 (* .cse13 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_345 (* .cse4 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_345 (* .cse7 4))))) (let ((.cse17 (select .cse3 (+ v_~f~0.offset_345 (* .cse8 4))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_345 (* .cse17 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_345 (* .cse9 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_345 (* .cse2 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_349)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_349)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_349)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_345 (* v_~x1~0_624 4))) v_~x1~0_623) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_349)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_345 (* .cse0 4))) v_~x2~0_533) (= (ite (and (<= 0 v_~x1~0_624) (< v_~x1~0_624 v_~size~0_349)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332|) (not (= (ite (and (< .cse5 v_~size~0_349) (<= 0 .cse5)) 1 0) 0)) (< 15 (mod (* 3 v_~n~0_339) 4294967296)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_349)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|) (= |v_thread1Thread1of1ForFork0_~i~0#1_446| 1) (not (= (ite (and (< .cse7 v_~size~0_349) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_349) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_349)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_375| 18) (not (= (ite (and (< .cse10 v_~size~0_349) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_349) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_349)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_349) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_349)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334| 0)) (not (= (ite (and (< .cse15 v_~size~0_349) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_349) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_535) (< v_~x2~0_535 v_~size~0_349)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_349)) 1 0) 0))))))))))))))))))))) InVars {~x2~0=v_~x2~0_535, ~size~0=v_~size~0_349, ~f~0.base=v_~f~0.base_349, #memory_int=|v_#memory_int_482|, ~n~0=v_~n~0_339, ~x1~0=v_~x1~0_624, ~f~0.offset=v_~f~0.offset_345} OutVars{~x2~0=v_~x2~0_533, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_340|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_294|, ~size~0=v_~size~0_349, ~f~0.base=v_~f~0.base_349, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_266|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_375|, ~x1~0=v_~x1~0_623, ~f~0.offset=v_~f~0.offset_345, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_258|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_446|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_256|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_266|, ~n~0=v_~n~0_339, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_270|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_350|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:29,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [810] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_486| v_~f~0.base_353))) (let ((.cse20 (select .cse1 (+ v_~f~0.offset_349 (* v_~x2~0_545 4))))) (let ((.cse13 (select .cse1 (+ v_~f~0.offset_349 (* .cse20 4))))) (let ((.cse12 (select .cse1 (+ v_~f~0.offset_349 (* .cse13 4))))) (let ((.cse18 (select .cse1 (+ v_~f~0.offset_349 (* .cse12 4))))) (let ((.cse15 (select .cse1 (+ v_~f~0.offset_349 (* .cse18 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse15))))) (let ((.cse16 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse2))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_349 (* .cse16 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_349 (* .cse4 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_349 (* .cse3 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_349 (* .cse5 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_349 (* .cse11 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_349 (* .cse10 4))))) (let ((.cse14 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse8))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_349 (* .cse14 4))))) (let ((.cse19 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse0))))) (let ((.cse17 (select .cse1 (+ v_~f~0.offset_349 (* .cse19 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_349 (* .cse17 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_349 (* .cse6 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_349 (* .cse7 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_353) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_349 (* v_~x1~0_634 4))) v_~x1~0_633) (not (= (ite (and (< .cse2 v_~size~0_353) (<= 0 .cse2)) 1 0) 0)) (< 18 (mod (* 3 v_~n~0_343) 4294967296)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_353)) 1 0) 0)) (= 21 |v_thread2Thread1of1ForFork1_~i~1#1_381|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_353)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_338| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_354|) (not (= (ite (and (< .cse5 v_~size~0_353) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_353) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_353) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_353)) 1 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_353) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_353) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_353) (<= 0 .cse15)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_349 (* .cse9 4))) v_~x2~0_543) (= |v_thread1Thread1of1ForFork0_~i~0#1_452| 1) (not (= (ite (and (< .cse16 v_~size~0_353) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_545 v_~size~0_353) (<= 0 v_~x2~0_545)) 1 0) 0)) (= (ite (and (< v_~x1~0_634 v_~size~0_353) (<= 0 v_~x1~0_634)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_338|) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_353)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_354| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_340|) (not (= (ite (and (< .cse19 v_~size~0_353) (<= 0 .cse19)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_353) (<= 0 .cse20)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_340| 0)))))))))))))))))))))))) InVars {~x2~0=v_~x2~0_545, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_353, #memory_int=|v_#memory_int_486|, ~n~0=v_~n~0_343, ~x1~0=v_~x1~0_634, ~f~0.offset=v_~f~0.offset_349} OutVars{~x2~0=v_~x2~0_543, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_346|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_300|, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_353, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_272|, 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_381|, ~x1~0=v_~x1~0_633, ~f~0.offset=v_~f~0.offset_349, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_340|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_338|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_264|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_452|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_262|, #memory_int=|v_#memory_int_486|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_354|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_272|, ~n~0=v_~n~0_343, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_276|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_356|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:32,467 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:48:32,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19777 [2022-12-06 05:48:32,468 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 918 flow [2022-12-06 05:48:32,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:32,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:32,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:32,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:32,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:32,668 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:48:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash 917190322, now seen corresponding path program 1 times [2022-12-06 05:48:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:32,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544461453] [2022-12-06 05:48:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:32,779 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:48:32,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:32,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544461453] [2022-12-06 05:48:32,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544461453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:32,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854156189] [2022-12-06 05:48:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:32,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:32,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:32,781 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:48:32,784 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:48:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:32,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:48:32,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:32,988 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:48:32,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:33,018 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:48:33,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854156189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:33,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:33,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-12-06 05:48:33,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261952134] [2022-12-06 05:48:33,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:33,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:48:33,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:33,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:48:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:48:33,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:48:33,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 918 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:33,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:33,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:48:33,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:33,521 INFO L130 PetriNetUnfolder]: 469/892 cut-off events. [2022-12-06 05:48:33,521 INFO L131 PetriNetUnfolder]: For 5832/5832 co-relation queries the response was YES. [2022-12-06 05:48:33,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5342 conditions, 892 events. 469/892 cut-off events. For 5832/5832 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4087 event pairs, 196 based on Foata normal form. 18/908 useless extension candidates. Maximal degree in co-relation 5183. Up to 622 conditions per place. [2022-12-06 05:48:33,525 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 83 selfloop transitions, 5 changer transitions 57/145 dead transitions. [2022-12-06 05:48:33,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 145 transitions, 1799 flow [2022-12-06 05:48:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:48:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:48:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 99 transitions. [2022-12-06 05:48:33,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17128027681660898 [2022-12-06 05:48:33,527 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 918 flow. Second operand 17 states and 99 transitions. [2022-12-06 05:48:33,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 145 transitions, 1799 flow [2022-12-06 05:48:33,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 145 transitions, 1612 flow, removed 76 selfloop flow, removed 10 redundant places. [2022-12-06 05:48:33,537 INFO L231 Difference]: Finished difference. Result has 103 places, 70 transitions, 657 flow [2022-12-06 05:48:33,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=657, PETRI_PLACES=103, PETRI_TRANSITIONS=70} [2022-12-06 05:48:33,538 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 05:48:33,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:33,538 INFO L89 Accepts]: Start accepts. Operand has 103 places, 70 transitions, 657 flow [2022-12-06 05:48:33,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:33,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:33,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 70 transitions, 657 flow [2022-12-06 05:48:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 70 transitions, 657 flow [2022-12-06 05:48:33,557 INFO L130 PetriNetUnfolder]: 56/230 cut-off events. [2022-12-06 05:48:33,557 INFO L131 PetriNetUnfolder]: For 1427/1445 co-relation queries the response was YES. [2022-12-06 05:48:33,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 230 events. 56/230 cut-off events. For 1427/1445 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1185 event pairs, 4 based on Foata normal form. 2/226 useless extension candidates. Maximal degree in co-relation 1045. Up to 69 conditions per place. [2022-12-06 05:48:33,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 70 transitions, 657 flow [2022-12-06 05:48:33,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 05:48:33,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:33,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 05:48:33,694 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 663 flow [2022-12-06 05:48:33,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:33,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:33,694 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:33,701 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:48:33,894 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,SelfDestructingSolverStorable42 [2022-12-06 05:48:33,894 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:48:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash -270304831, now seen corresponding path program 1 times [2022-12-06 05:48:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:33,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115555954] [2022-12-06 05:48:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:34,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115555954] [2022-12-06 05:48:34,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115555954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:34,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988551740] [2022-12-06 05:48:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:34,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:34,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:34,971 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:48:34,987 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:48:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:35,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:48:35,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:35,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:35,178 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 05:48:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:35,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:35,339 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-06 05:48:35,339 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 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 177 [2022-12-06 05:48:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:35,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988551740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:35,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:35,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-06 05:48:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909879736] [2022-12-06 05:48:35,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:35,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:48:35,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:48:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:48:35,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:48:35,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 663 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:48:35,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:35,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:48:35,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:35,927 INFO L130 PetriNetUnfolder]: 434/809 cut-off events. [2022-12-06 05:48:35,927 INFO L131 PetriNetUnfolder]: For 5257/5257 co-relation queries the response was YES. [2022-12-06 05:48:35,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 809 events. 434/809 cut-off events. For 5257/5257 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3610 event pairs, 107 based on Foata normal form. 1/810 useless extension candidates. Maximal degree in co-relation 4732. Up to 758 conditions per place. [2022-12-06 05:48:35,931 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 80 selfloop transitions, 17 changer transitions 1/98 dead transitions. [2022-12-06 05:48:35,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 1118 flow [2022-12-06 05:48:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:48:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:48:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-12-06 05:48:35,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28804347826086957 [2022-12-06 05:48:35,940 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 663 flow. Second operand 8 states and 53 transitions. [2022-12-06 05:48:35,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 1118 flow [2022-12-06 05:48:35,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 98 transitions, 1066 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-06 05:48:35,953 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 842 flow [2022-12-06 05:48:35,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=842, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2022-12-06 05:48:35,953 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 05:48:35,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:35,953 INFO L89 Accepts]: Start accepts. Operand has 83 places, 82 transitions, 842 flow [2022-12-06 05:48:35,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:35,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:35,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 82 transitions, 842 flow [2022-12-06 05:48:35,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 842 flow [2022-12-06 05:48:35,983 INFO L130 PetriNetUnfolder]: 65/254 cut-off events. [2022-12-06 05:48:35,983 INFO L131 PetriNetUnfolder]: For 1188/1209 co-relation queries the response was YES. [2022-12-06 05:48:35,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 254 events. 65/254 cut-off events. For 1188/1209 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1358 event pairs, 5 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 1102. Up to 79 conditions per place. [2022-12-06 05:48:35,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 82 transitions, 842 flow [2022-12-06 05:48:35,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 05:48:38,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:39,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:39,630 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:48:39,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3678 [2022-12-06 05:48:39,631 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 901 flow [2022-12-06 05:48:39,631 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:48:39,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:39,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:39,636 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:48:39,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 05:48:39,831 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:48:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1427422436, now seen corresponding path program 1 times [2022-12-06 05:48:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:39,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143414799] [2022-12-06 05:48:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:39,936 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:39,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:39,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143414799] [2022-12-06 05:48:39,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143414799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:48:39,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:48:39,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:48:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160315013] [2022-12-06 05:48:39,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:48:39,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:48:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:39,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:48:39,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:48:39,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:48:39,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 901 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:48:39,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:39,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:48:39,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:40,302 INFO L130 PetriNetUnfolder]: 490/913 cut-off events. [2022-12-06 05:48:40,303 INFO L131 PetriNetUnfolder]: For 5258/5258 co-relation queries the response was YES. [2022-12-06 05:48:40,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 913 events. 490/913 cut-off events. For 5258/5258 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4282 event pairs, 214 based on Foata normal form. 4/916 useless extension candidates. Maximal degree in co-relation 5330. Up to 678 conditions per place. [2022-12-06 05:48:40,307 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 103 selfloop transitions, 12 changer transitions 2/117 dead transitions. [2022-12-06 05:48:40,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 1472 flow [2022-12-06 05:48:40,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:48:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:48:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 05:48:40,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3390804597701149 [2022-12-06 05:48:40,308 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 901 flow. Second operand 6 states and 59 transitions. [2022-12-06 05:48:40,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 1472 flow [2022-12-06 05:48:40,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 1372 flow, removed 50 selfloop flow, removed 0 redundant places. [2022-12-06 05:48:40,325 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 919 flow [2022-12-06 05:48:40,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2022-12-06 05:48:40,325 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 05:48:40,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:40,325 INFO L89 Accepts]: Start accepts. Operand has 91 places, 86 transitions, 919 flow [2022-12-06 05:48:40,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:40,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:40,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 919 flow [2022-12-06 05:48:40,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 86 transitions, 919 flow [2022-12-06 05:48:40,365 INFO L130 PetriNetUnfolder]: 73/277 cut-off events. [2022-12-06 05:48:40,365 INFO L131 PetriNetUnfolder]: For 1829/1858 co-relation queries the response was YES. [2022-12-06 05:48:40,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 277 events. 73/277 cut-off events. For 1829/1858 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1525 event pairs, 9 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 1350. Up to 87 conditions per place. [2022-12-06 05:48:40,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 86 transitions, 919 flow [2022-12-06 05:48:40,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 05:48:40,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:40,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 05:48:40,568 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 921 flow [2022-12-06 05:48:40,569 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:48:40,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:40,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:40,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 05:48:40,569 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:48:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1903161281, now seen corresponding path program 1 times [2022-12-06 05:48:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:40,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027337203] [2022-12-06 05:48:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:40,662 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:48:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:40,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027337203] [2022-12-06 05:48:40,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027337203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:40,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154038949] [2022-12-06 05:48:40,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:40,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:40,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:40,681 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:48:40,683 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:48:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:40,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:48:40,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:40,855 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:48:40,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:40,935 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:48:40,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154038949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:40,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:40,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:48:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354728365] [2022-12-06 05:48:40,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:40,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:48:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:40,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:48:40,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:48:40,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:48:40,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 921 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:48:40,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:40,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:48:40,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:43,500 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:48:43,692 INFO L130 PetriNetUnfolder]: 545/1125 cut-off events. [2022-12-06 05:48:43,692 INFO L131 PetriNetUnfolder]: For 8223/8223 co-relation queries the response was YES. [2022-12-06 05:48:43,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6665 conditions, 1125 events. 545/1125 cut-off events. For 8223/8223 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6350 event pairs, 84 based on Foata normal form. 10/1135 useless extension candidates. Maximal degree in co-relation 6502. Up to 464 conditions per place. [2022-12-06 05:48:43,700 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 124 selfloop transitions, 46 changer transitions 11/181 dead transitions. [2022-12-06 05:48:43,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 181 transitions, 2205 flow [2022-12-06 05:48:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:48:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:48:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-06 05:48:43,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2597402597402597 [2022-12-06 05:48:43,702 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 921 flow. Second operand 11 states and 80 transitions. [2022-12-06 05:48:43,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 181 transitions, 2205 flow [2022-12-06 05:48:43,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 181 transitions, 2129 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:43,723 INFO L231 Difference]: Finished difference. Result has 100 places, 122 transitions, 1498 flow [2022-12-06 05:48:43,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1498, PETRI_PLACES=100, PETRI_TRANSITIONS=122} [2022-12-06 05:48:43,724 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-06 05:48:43,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:43,724 INFO L89 Accepts]: Start accepts. Operand has 100 places, 122 transitions, 1498 flow [2022-12-06 05:48:43,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:43,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:43,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 122 transitions, 1498 flow [2022-12-06 05:48:43,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 122 transitions, 1498 flow [2022-12-06 05:48:43,777 INFO L130 PetriNetUnfolder]: 110/448 cut-off events. [2022-12-06 05:48:43,777 INFO L131 PetriNetUnfolder]: For 3933/3941 co-relation queries the response was YES. [2022-12-06 05:48:43,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 448 events. 110/448 cut-off events. For 3933/3941 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2972 event pairs, 5 based on Foata normal form. 2/447 useless extension candidates. Maximal degree in co-relation 2394. Up to 128 conditions per place. [2022-12-06 05:48:43,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 122 transitions, 1498 flow [2022-12-06 05:48:43,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 05:48:43,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [828] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_520| v_~f~0.base_380))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_376 (* v_~x1~0_701 4)))) (.cse2 (mod (* 3 v_~n~0_367) 4294967296))) (and (= (select .cse0 (+ v_~f~0.offset_376 (* .cse1 4))) v_~x1~0_699) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_378| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_394|) (= (ite (and (< .cse1 v_~size~0_377) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_378|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_394| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_501| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_501| 1) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_499| (+ |v_thread1Thread1of1ForFork0_~i~0#1_501| 2)) (not (= (ite (and (<= 0 v_~x1~0_701) (< v_~x1~0_701 v_~size~0_377)) 1 0) 0))))) InVars {~size~0=v_~size~0_377, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_520|, ~n~0=v_~n~0_367, ~x1~0=v_~x1~0_701, ~f~0.offset=v_~f~0.offset_376} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_386|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_378|, ~size~0=v_~size~0_377, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_499|, #memory_int=|v_#memory_int_520|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_394|, ~n~0=v_~n~0_367, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_396|, ~x1~0=v_~x1~0_699, ~f~0.offset=v_~f~0.offset_376} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:44,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:44,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [830] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_522| v_~f~0.base_382))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_378 (* v_~x1~0_707 4)))) (.cse2 (mod (* 3 v_~n~0_369) 4294967296))) (and (= v_~x1~0_705 (select .cse0 (+ v_~f~0.offset_378 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_382| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_398|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_398| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_507| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_505| (+ |v_thread1Thread1of1ForFork0_~i~0#1_507| 2)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_379)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_382|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_507| 1) 4294967296) .cse2) (not (= (ite (and (< v_~x1~0_707 v_~size~0_379) (<= 0 v_~x1~0_707)) 1 0) 0))))) InVars {~size~0=v_~size~0_379, ~f~0.base=v_~f~0.base_382, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_507|, #memory_int=|v_#memory_int_522|, ~n~0=v_~n~0_369, ~x1~0=v_~x1~0_707, ~f~0.offset=v_~f~0.offset_378} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_390|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_382|, ~size~0=v_~size~0_379, ~f~0.base=v_~f~0.base_382, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_505|, #memory_int=|v_#memory_int_522|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_398|, ~n~0=v_~n~0_369, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_400|, ~x1~0=v_~x1~0_705, ~f~0.offset=v_~f~0.offset_378} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:44,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:44,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [820] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_500| v_~f~0.base_366))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_362 (* v_~x1~0_677 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_365)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse2 4))) v_~x1~0_675) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382| 0)) (not (= (ite (and (<= 0 v_~x1~0_677) (< v_~x1~0_677 v_~size~0_365)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_483| 4294967295) 4294967296) (mod (* 3 v_~n~0_355) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_365)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|))))) InVars {~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, #memory_int=|v_#memory_int_500|, ~n~0=v_~n~0_355, ~x1~0=v_~x1~0_677, ~f~0.offset=v_~f~0.offset_362} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_374|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|, ~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|, ~n~0=v_~n~0_355, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|, ~x1~0=v_~x1~0_675, ~f~0.offset=v_~f~0.offset_362} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:44,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:44,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:44,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:44,964 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,192 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:45,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,336 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [820] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_500| v_~f~0.base_366))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_362 (* v_~x1~0_677 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_365)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse2 4))) v_~x1~0_675) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382| 0)) (not (= (ite (and (<= 0 v_~x1~0_677) (< v_~x1~0_677 v_~size~0_365)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_483| 4294967295) 4294967296) (mod (* 3 v_~n~0_355) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_365)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|))))) InVars {~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, #memory_int=|v_#memory_int_500|, ~n~0=v_~n~0_355, ~x1~0=v_~x1~0_677, ~f~0.offset=v_~f~0.offset_362} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_374|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|, ~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|, ~n~0=v_~n~0_355, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|, ~x1~0=v_~x1~0_675, ~f~0.offset=v_~f~0.offset_362} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,604 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:46,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:47,156 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:48:47,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3433 [2022-12-06 05:48:47,157 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 121 transitions, 1919 flow [2022-12-06 05:48:47,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:48:47,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:47,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:47,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:47,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:47,363 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:48:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash -446704952, now seen corresponding path program 1 times [2022-12-06 05:48:47,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:47,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215620981] [2022-12-06 05:48:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215620981] [2022-12-06 05:48:47,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215620981] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724290193] [2022-12-06 05:48:47,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:47,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:47,443 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:48:47,445 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:48:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:47,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:48:47,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:47,579 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:48:47,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:47,614 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:48:47,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724290193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:47,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:47,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 05:48:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293534054] [2022-12-06 05:48:47,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:47,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:48:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:48:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:48:47,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:48:47,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 121 transitions, 1919 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:47,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:47,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:48:47,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:48,044 INFO L130 PetriNetUnfolder]: 551/1128 cut-off events. [2022-12-06 05:48:48,044 INFO L131 PetriNetUnfolder]: For 12929/12929 co-relation queries the response was YES. [2022-12-06 05:48:48,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7979 conditions, 1128 events. 551/1128 cut-off events. For 12929/12929 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6288 event pairs, 257 based on Foata normal form. 12/1140 useless extension candidates. Maximal degree in co-relation 7802. Up to 1099 conditions per place. [2022-12-06 05:48:48,050 INFO L137 encePairwiseOnDemand]: 45/55 looper letters, 120 selfloop transitions, 15 changer transitions 2/137 dead transitions. [2022-12-06 05:48:48,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 137 transitions, 2381 flow [2022-12-06 05:48:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:48:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:48:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-06 05:48:48,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23030303030303031 [2022-12-06 05:48:48,051 INFO L175 Difference]: Start difference. First operand has 96 places, 121 transitions, 1919 flow. Second operand 6 states and 76 transitions. [2022-12-06 05:48:48,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 137 transitions, 2381 flow [2022-12-06 05:48:48,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 137 transitions, 2243 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:48,113 INFO L231 Difference]: Finished difference. Result has 101 places, 127 transitions, 1962 flow [2022-12-06 05:48:48,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1962, PETRI_PLACES=101, PETRI_TRANSITIONS=127} [2022-12-06 05:48:48,114 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-06 05:48:48,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:48,114 INFO L89 Accepts]: Start accepts. Operand has 101 places, 127 transitions, 1962 flow [2022-12-06 05:48:48,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:48,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:48,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 127 transitions, 1962 flow [2022-12-06 05:48:48,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 127 transitions, 1962 flow [2022-12-06 05:48:48,157 INFO L130 PetriNetUnfolder]: 114/456 cut-off events. [2022-12-06 05:48:48,157 INFO L131 PetriNetUnfolder]: For 5399/5414 co-relation queries the response was YES. [2022-12-06 05:48:48,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 456 events. 114/456 cut-off events. For 5399/5414 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3072 event pairs, 5 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 2775. Up to 126 conditions per place. [2022-12-06 05:48:48,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 127 transitions, 1962 flow [2022-12-06 05:48:48,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 05:48:48,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_516| v_~f~0.base_376))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_372 (* v_~x1~0_691 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_372 (* 4 .cse3)))) (.cse2 (mod (* 3 v_~n~0_363) 4294967296))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_489| (+ |v_thread1Thread1of1ForFork0_~i~0#1_491| 3)) (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_372)) v_~x1~0_689) (not (= (ite (and (<= 0 v_~x1~0_691) (< v_~x1~0_691 v_~size~0_373)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_491| 1) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_373)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_491| 4294967296) .cse2) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_373)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_491| 2) 4294967296) .cse2))))) InVars {~size~0=v_~size~0_373, ~f~0.base=v_~f~0.base_376, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_491|, #memory_int=|v_#memory_int_516|, ~n~0=v_~n~0_363, ~x1~0=v_~x1~0_691, ~f~0.offset=v_~f~0.offset_372} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_380|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372|, ~size~0=v_~size~0_373, ~f~0.base=v_~f~0.base_376, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_489|, #memory_int=|v_#memory_int_516|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|, ~n~0=v_~n~0_363, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_390|, ~x1~0=v_~x1~0_689, ~f~0.offset=v_~f~0.offset_372} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:49,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:49,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1118 [2022-12-06 05:48:49,232 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 127 transitions, 1976 flow [2022-12-06 05:48:49,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:49,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:49,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:49,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:49,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:49,433 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:48:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash -27900604, now seen corresponding path program 1 times [2022-12-06 05:48:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:49,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100410607] [2022-12-06 05:48:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:49,519 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:48:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:49,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100410607] [2022-12-06 05:48:49,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100410607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:49,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561575400] [2022-12-06 05:48:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:49,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:49,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:49,539 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:48:49,541 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:48:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:49,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:48:49,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:49,671 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:48:49,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:49,702 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:48:49,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561575400] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:49,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:49,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:48:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459799476] [2022-12-06 05:48:49,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:49,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:48:49,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:49,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:48:49,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:48:49,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:48:49,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 127 transitions, 1976 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:48:49,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:49,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:48:49,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:50,073 INFO L130 PetriNetUnfolder]: 561/1136 cut-off events. [2022-12-06 05:48:50,073 INFO L131 PetriNetUnfolder]: For 15795/15795 co-relation queries the response was YES. [2022-12-06 05:48:50,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8362 conditions, 1136 events. 561/1136 cut-off events. For 15795/15795 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6305 event pairs, 255 based on Foata normal form. 8/1142 useless extension candidates. Maximal degree in co-relation 8183. Up to 1073 conditions per place. [2022-12-06 05:48:50,079 INFO L137 encePairwiseOnDemand]: 42/56 looper letters, 113 selfloop transitions, 28 changer transitions 4/145 dead transitions. [2022-12-06 05:48:50,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 145 transitions, 2557 flow [2022-12-06 05:48:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:48:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:48:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-06 05:48:50,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18973214285714285 [2022-12-06 05:48:50,080 INFO L175 Difference]: Start difference. First operand has 100 places, 127 transitions, 1976 flow. Second operand 8 states and 85 transitions. [2022-12-06 05:48:50,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 145 transitions, 2557 flow [2022-12-06 05:48:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 145 transitions, 2406 flow, removed 71 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:50,109 INFO L231 Difference]: Finished difference. Result has 107 places, 132 transitions, 2063 flow [2022-12-06 05:48:50,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2063, PETRI_PLACES=107, PETRI_TRANSITIONS=132} [2022-12-06 05:48:50,109 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2022-12-06 05:48:50,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:50,109 INFO L89 Accepts]: Start accepts. Operand has 107 places, 132 transitions, 2063 flow [2022-12-06 05:48:50,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:50,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:50,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 132 transitions, 2063 flow [2022-12-06 05:48:50,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 132 transitions, 2063 flow [2022-12-06 05:48:50,148 INFO L130 PetriNetUnfolder]: 119/455 cut-off events. [2022-12-06 05:48:50,148 INFO L131 PetriNetUnfolder]: For 6056/6072 co-relation queries the response was YES. [2022-12-06 05:48:50,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 455 events. 119/455 cut-off events. For 6056/6072 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3011 event pairs, 5 based on Foata normal form. 3/454 useless extension candidates. Maximal degree in co-relation 2892. Up to 128 conditions per place. [2022-12-06 05:48:50,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 132 transitions, 2063 flow [2022-12-06 05:48:50,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 05:48:52,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_586| v_~f~0.base_446))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_442 (* v_~x2~0_584 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_442 (* v_~x1~0_843 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_442 (* .cse5 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_442 (* .cse3 4)))) (.cse0 (mod (* 3 v_~n~0_433) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 1) 4294967296) .cse0) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_464|) |v_thread2Thread1of1ForFork1_~i~1#1_463|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 2) 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse2 4))) v_~x1~0_842) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|) (= (ite (and (< .cse2 v_~size~0_443) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|) (not (= (ite (and (< v_~x1~0_843 v_~size~0_443) (<= 0 v_~x1~0_843)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_636| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x2~0_584) (< v_~x2~0_584 v_~size~0_443)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_635| (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 3)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|) (not (= (ite (and (< .cse3 v_~size~0_443) (<= 0 .cse3)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse4 4))) v_~x2~0_583) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_443)) 1 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_443)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_464| 4294967296) .cse0))))) InVars {~x2~0=v_~x2~0_584, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_636|, #memory_int=|v_#memory_int_586|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_464|, ~n~0=v_~n~0_433, ~x1~0=v_~x1~0_843, ~f~0.offset=v_~f~0.offset_442} OutVars{~x2~0=v_~x2~0_583, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_463|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_322|, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_294|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_463|, ~x1~0=v_~x1~0_842, ~f~0.offset=v_~f~0.offset_442, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_286|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_635|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_284|, #memory_int=|v_#memory_int_586|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_294|, ~n~0=v_~n~0_433, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_298|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_473|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:53,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_586| v_~f~0.base_446))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_442 (* v_~x2~0_584 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_442 (* v_~x1~0_843 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_442 (* .cse5 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_442 (* .cse3 4)))) (.cse0 (mod (* 3 v_~n~0_433) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 1) 4294967296) .cse0) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_464|) |v_thread2Thread1of1ForFork1_~i~1#1_463|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 2) 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse2 4))) v_~x1~0_842) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|) (= (ite (and (< .cse2 v_~size~0_443) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|) (not (= (ite (and (< v_~x1~0_843 v_~size~0_443) (<= 0 v_~x1~0_843)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_636| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x2~0_584) (< v_~x2~0_584 v_~size~0_443)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_635| (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 3)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|) (not (= (ite (and (< .cse3 v_~size~0_443) (<= 0 .cse3)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse4 4))) v_~x2~0_583) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_443)) 1 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_443)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_464| 4294967296) .cse0))))) InVars {~x2~0=v_~x2~0_584, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_636|, #memory_int=|v_#memory_int_586|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_464|, ~n~0=v_~n~0_433, ~x1~0=v_~x1~0_843, ~f~0.offset=v_~f~0.offset_442} OutVars{~x2~0=v_~x2~0_583, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_463|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_322|, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_294|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_463|, ~x1~0=v_~x1~0_842, ~f~0.offset=v_~f~0.offset_442, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_286|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_635|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_284|, #memory_int=|v_#memory_int_586|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_294|, ~n~0=v_~n~0_433, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_298|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_473|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:54,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_524| v_~f~0.base_384))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_380 (* v_~x2~0_575 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_380 (* .cse4 4)))) (.cse2 (mod (* 3 v_~n~0_371) 4294967296)) (.cse1 (select .cse0 (+ v_~f~0.offset_380 (* v_~x1~0_714 4))))) (and (= v_~x1~0_713 (select .cse0 (+ v_~f~0.offset_380 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x1~0_714) (< v_~x1~0_714 v_~size~0_381)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_515| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_325| (ite (and (< .cse3 v_~size~0_381) (<= 0 .cse3)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_515| 1) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_325| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_357|) (not (= (ite (and (< .cse4 v_~size~0_381) (<= 0 .cse4)) 1 0) 0)) (= (select .cse0 (+ (* .cse3 4) v_~f~0.offset_380)) v_~x2~0_574) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_404|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_357| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_400| (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_401|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_401| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_514| (+ |v_thread1Thread1of1ForFork0_~i~0#1_515| 2)) (= (ite (and (< .cse1 v_~size~0_381) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_404| 0)) (not (= 0 (ite (and (< v_~x2~0_575 v_~size~0_381) (<= 0 v_~x2~0_575)) 1 0))))))) InVars {~x2~0=v_~x2~0_575, ~size~0=v_~size~0_381, ~f~0.base=v_~f~0.base_384, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_515|, #memory_int=|v_#memory_int_524|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_401|, ~n~0=v_~n~0_371, ~x1~0=v_~x1~0_714, ~f~0.offset=v_~f~0.offset_380} OutVars{~x2~0=v_~x2~0_574, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_396|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_317|, ~size~0=v_~size~0_381, ~f~0.base=v_~f~0.base_384, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_289|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_325|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_400|, ~x1~0=v_~x1~0_713, ~f~0.offset=v_~f~0.offset_380, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_357|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_281|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_514|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_279|, #memory_int=|v_#memory_int_524|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_404|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_289|, ~n~0=v_~n~0_371, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_293|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_406|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:56,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:56,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:56,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:48:57,338 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:48:57,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7238 [2022-12-06 05:48:57,348 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 132 transitions, 2148 flow [2022-12-06 05:48:57,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:48:57,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:57,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:57,353 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:48:57,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 05:48:57,553 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:48:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 236684596, now seen corresponding path program 1 times [2022-12-06 05:48:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:57,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876983335] [2022-12-06 05:48:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:57,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:48:57,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876983335] [2022-12-06 05:48:57,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876983335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032135995] [2022-12-06 05:48:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:57,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:57,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:57,807 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:48:57,809 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:48:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:58,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:48:58,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:58,085 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:48:58,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:58,174 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:48:58,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032135995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:58,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:58,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:48:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007347674] [2022-12-06 05:48:58,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:58,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:48:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:48:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:48:58,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 05:48:58,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 132 transitions, 2148 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) 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:48:58,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:58,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 05:48:58,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:00,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:49:01,288 INFO L130 PetriNetUnfolder]: 620/1255 cut-off events. [2022-12-06 05:49:01,288 INFO L131 PetriNetUnfolder]: For 17541/17541 co-relation queries the response was YES. [2022-12-06 05:49:01,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 1255 events. 620/1255 cut-off events. For 17541/17541 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7169 event pairs, 227 based on Foata normal form. 8/1261 useless extension candidates. Maximal degree in co-relation 9169. Up to 931 conditions per place. [2022-12-06 05:49:01,295 INFO L137 encePairwiseOnDemand]: 27/65 looper letters, 98 selfloop transitions, 65 changer transitions 10/173 dead transitions. [2022-12-06 05:49:01,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 173 transitions, 3070 flow [2022-12-06 05:49:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:49:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:49:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-06 05:49:01,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1794871794871795 [2022-12-06 05:49:01,296 INFO L175 Difference]: Start difference. First operand has 106 places, 132 transitions, 2148 flow. Second operand 9 states and 105 transitions. [2022-12-06 05:49:01,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 173 transitions, 3070 flow [2022-12-06 05:49:01,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 173 transitions, 2918 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-12-06 05:49:01,333 INFO L231 Difference]: Finished difference. Result has 114 places, 136 transitions, 2325 flow [2022-12-06 05:49:01,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2325, PETRI_PLACES=114, PETRI_TRANSITIONS=136} [2022-12-06 05:49:01,334 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 05:49:01,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:01,334 INFO L89 Accepts]: Start accepts. Operand has 114 places, 136 transitions, 2325 flow [2022-12-06 05:49:01,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:01,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:01,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 136 transitions, 2325 flow [2022-12-06 05:49:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 136 transitions, 2325 flow [2022-12-06 05:49:01,378 INFO L130 PetriNetUnfolder]: 131/503 cut-off events. [2022-12-06 05:49:01,378 INFO L131 PetriNetUnfolder]: For 6629/6644 co-relation queries the response was YES. [2022-12-06 05:49:01,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3404 conditions, 503 events. 131/503 cut-off events. For 6629/6644 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3449 event pairs, 7 based on Foata normal form. 2/501 useless extension candidates. Maximal degree in co-relation 3289. Up to 149 conditions per place. [2022-12-06 05:49:01,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 136 transitions, 2325 flow [2022-12-06 05:49:01,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 05:49:01,383 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:01,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 05:49:01,383 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 136 transitions, 2325 flow [2022-12-06 05:49:01,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) 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:49:01,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:01,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:01,390 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:49:01,589 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,SelfDestructingSolverStorable48 [2022-12-06 05:49:01,589 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:49:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash 821799550, now seen corresponding path program 1 times [2022-12-06 05:49:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:01,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642156317] [2022-12-06 05:49:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:02,858 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:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642156317] [2022-12-06 05:49:02,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642156317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296109031] [2022-12-06 05:49:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:02,860 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:49:02,861 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:49:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:02,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:49:02,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:03,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:03,027 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 05:49:03,052 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:03,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:03,198 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-06 05:49:03,198 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 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 177 [2022-12-06 05:49:03,377 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:03,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296109031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:03,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:03,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 05:49:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556946883] [2022-12-06 05:49:03,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:03,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:49:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:49:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:49:03,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 05:49:03,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 136 transitions, 2325 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:03,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:03,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 05:49:03,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:03,908 INFO L130 PetriNetUnfolder]: 637/1265 cut-off events. [2022-12-06 05:49:03,908 INFO L131 PetriNetUnfolder]: For 16714/16714 co-relation queries the response was YES. [2022-12-06 05:49:03,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9573 conditions, 1265 events. 637/1265 cut-off events. For 16714/16714 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7051 event pairs, 99 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 9288. Up to 1223 conditions per place. [2022-12-06 05:49:03,914 INFO L137 encePairwiseOnDemand]: 42/62 looper letters, 126 selfloop transitions, 31 changer transitions 5/162 dead transitions. [2022-12-06 05:49:03,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 162 transitions, 2961 flow [2022-12-06 05:49:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:49:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:49:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-06 05:49:03,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-06 05:49:03,916 INFO L175 Difference]: Start difference. First operand has 110 places, 136 transitions, 2325 flow. Second operand 7 states and 93 transitions. [2022-12-06 05:49:03,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 162 transitions, 2961 flow [2022-12-06 05:49:03,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 2877 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-06 05:49:03,948 INFO L231 Difference]: Finished difference. Result has 113 places, 149 transitions, 2588 flow [2022-12-06 05:49:03,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2588, PETRI_PLACES=113, PETRI_TRANSITIONS=149} [2022-12-06 05:49:03,949 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 05:49:03,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:03,949 INFO L89 Accepts]: Start accepts. Operand has 113 places, 149 transitions, 2588 flow [2022-12-06 05:49:03,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:03,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:03,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 149 transitions, 2588 flow [2022-12-06 05:49:03,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 149 transitions, 2588 flow [2022-12-06 05:49:03,996 INFO L130 PetriNetUnfolder]: 141/505 cut-off events. [2022-12-06 05:49:03,996 INFO L131 PetriNetUnfolder]: For 6438/6453 co-relation queries the response was YES. [2022-12-06 05:49:03,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 505 events. 141/505 cut-off events. For 6438/6453 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3359 event pairs, 7 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 3323. Up to 152 conditions per place. [2022-12-06 05:49:04,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 149 transitions, 2588 flow [2022-12-06 05:49:04,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-06 05:49:04,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [862] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_584| v_~f~0.base_444))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_440 (* v_~x1~0_838 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_440 (* .cse1 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_440 (* .cse4 4)))) (.cse0 (mod (* 3 v_~n~0_431) 4294967296))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467|) (= |v_thread1Thread1of1ForFork0_~i~0#1_629| (+ |v_thread1Thread1of1ForFork0_~i~0#1_631| 4)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_629| 4294967295) 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_441) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_631| 2) 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x1~0_838) (< v_~x1~0_838 v_~size~0_441)) 1 0) 0)) (= v_~x1~0_836 (select .cse2 (+ v_~f~0.offset_440 (* .cse3 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_631| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467| 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_441)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_441)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_631| 1) 4294967296) .cse0)))))) InVars {~size~0=v_~size~0_441, ~f~0.base=v_~f~0.base_444, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_631|, #memory_int=|v_#memory_int_584|, ~n~0=v_~n~0_431, ~x1~0=v_~x1~0_838, ~f~0.offset=v_~f~0.offset_440} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_459|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451|, ~size~0=v_~size~0_441, ~f~0.base=v_~f~0.base_444, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_629|, #memory_int=|v_#memory_int_584|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467|, ~n~0=v_~n~0_431, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_469|, ~x1~0=v_~x1~0_836, ~f~0.offset=v_~f~0.offset_440} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:04,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:04,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 872 [2022-12-06 05:49:04,821 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 149 transitions, 2595 flow [2022-12-06 05:49:04,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:04,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:04,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:04,826 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:49:05,026 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,SelfDestructingSolverStorable49 [2022-12-06 05:49:05,026 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:49:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1380104443, now seen corresponding path program 1 times [2022-12-06 05:49:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:05,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121833722] [2022-12-06 05:49:05,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:05,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:49:05,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121833722] [2022-12-06 05:49:05,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121833722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129037753] [2022-12-06 05:49:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:05,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:05,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:05,141 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:49:05,142 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:49:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:05,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:49:05,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:05,281 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:05,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:05,316 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:05,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129037753] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:05,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:05,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:49:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380842945] [2022-12-06 05:49:05,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:05,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:49:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:49:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:49:05,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:49:05,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 149 transitions, 2595 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:05,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:05,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:49:05,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:06,132 INFO L130 PetriNetUnfolder]: 679/1335 cut-off events. [2022-12-06 05:49:06,132 INFO L131 PetriNetUnfolder]: For 17904/17904 co-relation queries the response was YES. [2022-12-06 05:49:06,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10349 conditions, 1335 events. 679/1335 cut-off events. For 17904/17904 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7469 event pairs, 281 based on Foata normal form. 14/1347 useless extension candidates. Maximal degree in co-relation 9944. Up to 1196 conditions per place. [2022-12-06 05:49:06,139 INFO L137 encePairwiseOnDemand]: 40/63 looper letters, 126 selfloop transitions, 53 changer transitions 8/187 dead transitions. [2022-12-06 05:49:06,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 187 transitions, 3612 flow [2022-12-06 05:49:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:49:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:49:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-12-06 05:49:06,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14814814814814814 [2022-12-06 05:49:06,141 INFO L175 Difference]: Start difference. First operand has 113 places, 149 transitions, 2595 flow. Second operand 12 states and 112 transitions. [2022-12-06 05:49:06,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 187 transitions, 3612 flow [2022-12-06 05:49:06,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 187 transitions, 3528 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 05:49:06,178 INFO L231 Difference]: Finished difference. Result has 128 places, 164 transitions, 3059 flow [2022-12-06 05:49:06,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2511, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3059, PETRI_PLACES=128, PETRI_TRANSITIONS=164} [2022-12-06 05:49:06,179 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 107 predicate places. [2022-12-06 05:49:06,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:06,179 INFO L89 Accepts]: Start accepts. Operand has 128 places, 164 transitions, 3059 flow [2022-12-06 05:49:06,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:06,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:06,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 164 transitions, 3059 flow [2022-12-06 05:49:06,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 164 transitions, 3059 flow [2022-12-06 05:49:06,232 INFO L130 PetriNetUnfolder]: 153/539 cut-off events. [2022-12-06 05:49:06,233 INFO L131 PetriNetUnfolder]: For 9420/9435 co-relation queries the response was YES. [2022-12-06 05:49:06,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 539 events. 153/539 cut-off events. For 9420/9435 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3630 event pairs, 7 based on Foata normal form. 2/536 useless extension candidates. Maximal degree in co-relation 3978. Up to 170 conditions per place. [2022-12-06 05:49:06,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 164 transitions, 3059 flow [2022-12-06 05:49:06,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 05:49:06,238 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:06,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 05:49:06,238 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 164 transitions, 3059 flow [2022-12-06 05:49:06,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:06,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:06,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:06,243 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:49:06,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:06,443 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:49:06,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1229310820, now seen corresponding path program 1 times [2022-12-06 05:49:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:06,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523705636] [2022-12-06 05:49:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:10,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:10,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523705636] [2022-12-06 05:49:10,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523705636] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:10,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360586324] [2022-12-06 05:49:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:10,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:10,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:10,505 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:49:10,506 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:49:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:49:10,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:10,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:10,762 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:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:11,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:12,763 INFO L321 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2022-12-06 05:49:12,763 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:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:24,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360586324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:24,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:24,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:49:24,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939333207] [2022-12-06 05:49:24,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:24,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:49:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:49:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:49:24,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:49:24,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 164 transitions, 3059 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:24,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:24,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:49:24,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:26,305 INFO L130 PetriNetUnfolder]: 717/1409 cut-off events. [2022-12-06 05:49:26,305 INFO L131 PetriNetUnfolder]: For 25609/25609 co-relation queries the response was YES. [2022-12-06 05:49:26,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11986 conditions, 1409 events. 717/1409 cut-off events. For 25609/25609 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8043 event pairs, 100 based on Foata normal form. 2/1407 useless extension candidates. Maximal degree in co-relation 11209. Up to 1298 conditions per place. [2022-12-06 05:49:26,317 INFO L137 encePairwiseOnDemand]: 40/63 looper letters, 147 selfloop transitions, 46 changer transitions 7/200 dead transitions. [2022-12-06 05:49:26,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 200 transitions, 4002 flow [2022-12-06 05:49:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:49:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:49:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-12-06 05:49:26,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17777777777777778 [2022-12-06 05:49:26,318 INFO L175 Difference]: Start difference. First operand has 128 places, 164 transitions, 3059 flow. Second operand 10 states and 112 transitions. [2022-12-06 05:49:26,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 200 transitions, 4002 flow [2022-12-06 05:49:26,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 200 transitions, 3740 flow, removed 104 selfloop flow, removed 3 redundant places. [2022-12-06 05:49:26,406 INFO L231 Difference]: Finished difference. Result has 135 places, 179 transitions, 3272 flow [2022-12-06 05:49:26,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3272, PETRI_PLACES=135, PETRI_TRANSITIONS=179} [2022-12-06 05:49:26,407 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 114 predicate places. [2022-12-06 05:49:26,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:26,407 INFO L89 Accepts]: Start accepts. Operand has 135 places, 179 transitions, 3272 flow [2022-12-06 05:49:26,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:26,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:26,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 179 transitions, 3272 flow [2022-12-06 05:49:26,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 179 transitions, 3272 flow [2022-12-06 05:49:26,491 INFO L130 PetriNetUnfolder]: 163/567 cut-off events. [2022-12-06 05:49:26,491 INFO L131 PetriNetUnfolder]: For 10078/10094 co-relation queries the response was YES. [2022-12-06 05:49:26,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4453 conditions, 567 events. 163/567 cut-off events. For 10078/10094 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3890 event pairs, 7 based on Foata normal form. 3/564 useless extension candidates. Maximal degree in co-relation 4068. Up to 175 conditions per place. [2022-12-06 05:49:26,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 179 transitions, 3272 flow [2022-12-06 05:49:26,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 05:49:27,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_463| v_~f~0.base_333))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_329 (* v_~x2~0_495 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_329 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_333)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_314| (ite (and (<= 0 v_~x1~0_595) (< v_~x1~0_595 v_~size~0_333)) 1 0)) (= v_~x1~0_594 (select .cse1 (+ v_~f~0.offset_329 (* v_~x1~0_595 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_314| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330|) (= v_~x2~0_494 (select .cse1 (+ v_~f~0.offset_329 (* .cse2 4)))) (not (= (ite (and (<= 0 v_~x2~0_495) (< v_~x2~0_495 v_~size~0_333)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| (ite (and (< .cse2 v_~size~0_333) (<= 0 .cse2)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_426| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_426| 4294967295) 4294967296) (mod (* 3 v_~n~0_323) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_346|))))) InVars {~x2~0=v_~x2~0_495, ~size~0=v_~size~0_333, ~f~0.base=v_~f~0.base_333, #memory_int=|v_#memory_int_463|, ~n~0=v_~n~0_323, ~x1~0=v_~x1~0_595, ~f~0.offset=v_~f~0.offset_329} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_322|, ~x2~0=v_~x2~0_494, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_269|, ~size~0=v_~size~0_333, ~f~0.base=v_~f~0.base_333, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_241|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_346|, ~x1~0=v_~x1~0_594, ~f~0.offset=v_~f~0.offset_329, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_314|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_233|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_426|, #memory_int=|v_#memory_int_463|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_231|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_241|, ~n~0=v_~n~0_323, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_332|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#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:32,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:32,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5656 [2022-12-06 05:49:32,063 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 179 transitions, 3415 flow [2022-12-06 05:49:32,063 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:32,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:32,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:32,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-06 05:49:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:32,271 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:49:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash 973349869, now seen corresponding path program 1 times [2022-12-06 05:49:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:32,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420833965] [2022-12-06 05:49:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:32,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420833965] [2022-12-06 05:49:32,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420833965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:32,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995083435] [2022-12-06 05:49:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:32,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:32,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:32,550 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:49:32,556 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:49:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:32,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:49:32,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:32,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:33,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995083435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:33,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:33,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 05:49:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37764300] [2022-12-06 05:49:33,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:33,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:49:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:49:33,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:49:33,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 05:49:33,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 179 transitions, 3415 flow. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:33,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:33,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 05:49:33,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:40,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:49:41,105 INFO L130 PetriNetUnfolder]: 791/1615 cut-off events. [2022-12-06 05:49:41,105 INFO L131 PetriNetUnfolder]: For 30553/30553 co-relation queries the response was YES. [2022-12-06 05:49:41,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13564 conditions, 1615 events. 791/1615 cut-off events. For 30553/30553 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9906 event pairs, 74 based on Foata normal form. 20/1631 useless extension candidates. Maximal degree in co-relation 11977. Up to 496 conditions per place. [2022-12-06 05:49:41,116 INFO L137 encePairwiseOnDemand]: 12/69 looper letters, 113 selfloop transitions, 152 changer transitions 6/271 dead transitions. [2022-12-06 05:49:41,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 271 transitions, 5193 flow [2022-12-06 05:49:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:49:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:49:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 139 transitions. [2022-12-06 05:49:41,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12590579710144928 [2022-12-06 05:49:41,118 INFO L175 Difference]: Start difference. First operand has 135 places, 179 transitions, 3415 flow. Second operand 16 states and 139 transitions. [2022-12-06 05:49:41,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 271 transitions, 5193 flow [2022-12-06 05:49:41,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 271 transitions, 4999 flow, removed 83 selfloop flow, removed 4 redundant places. [2022-12-06 05:49:41,195 INFO L231 Difference]: Finished difference. Result has 147 places, 217 transitions, 4272 flow [2022-12-06 05:49:41,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=3249, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4272, PETRI_PLACES=147, PETRI_TRANSITIONS=217} [2022-12-06 05:49:41,196 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 126 predicate places. [2022-12-06 05:49:41,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:41,196 INFO L89 Accepts]: Start accepts. Operand has 147 places, 217 transitions, 4272 flow [2022-12-06 05:49:41,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:41,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:41,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 217 transitions, 4272 flow [2022-12-06 05:49:41,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 217 transitions, 4272 flow [2022-12-06 05:49:41,265 INFO L130 PetriNetUnfolder]: 188/662 cut-off events. [2022-12-06 05:49:41,265 INFO L131 PetriNetUnfolder]: For 11990/12003 co-relation queries the response was YES. [2022-12-06 05:49:41,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 662 events. 188/662 cut-off events. For 11990/12003 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4759 event pairs, 6 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 4693. Up to 207 conditions per place. [2022-12-06 05:49:41,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 217 transitions, 4272 flow [2022-12-06 05:49:41,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 05:49:41,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:41,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 05:49:41,273 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 4272 flow [2022-12-06 05:49:41,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:41,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:41,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:41,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:41,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:41,478 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:49:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash 709827820, now seen corresponding path program 1 times [2022-12-06 05:49:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:41,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019277701] [2022-12-06 05:49:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:41,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:41,658 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:41,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:41,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019277701] [2022-12-06 05:49:41,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019277701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:41,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160700071] [2022-12-06 05:49:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:41,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:41,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:41,660 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:49:41,661 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:49:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:41,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:49:41,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:41,824 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:41,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:41,902 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:41,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160700071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:41,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:41,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:49:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152604134] [2022-12-06 05:49:41,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:49:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:49:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:49:41,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 05:49:41,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 4272 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:49:41,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:41,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 05:49:41,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:50,862 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:49:53,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:49:55,016 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:49:57,181 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:49:59,806 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:50:01,841 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:50:05,552 INFO L130 PetriNetUnfolder]: 915/1835 cut-off events. [2022-12-06 05:50:05,552 INFO L131 PetriNetUnfolder]: For 35039/35039 co-relation queries the response was YES. [2022-12-06 05:50:05,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16014 conditions, 1835 events. 915/1835 cut-off events. For 35039/35039 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11375 event pairs, 196 based on Foata normal form. 6/1837 useless extension candidates. Maximal degree in co-relation 13777. Up to 1109 conditions per place. [2022-12-06 05:50:05,569 INFO L137 encePairwiseOnDemand]: 38/69 looper letters, 198 selfloop transitions, 99 changer transitions 2/299 dead transitions. [2022-12-06 05:50:05,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 299 transitions, 6100 flow [2022-12-06 05:50:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:50:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:50:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-12-06 05:50:05,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12409420289855072 [2022-12-06 05:50:05,570 INFO L175 Difference]: Start difference. First operand has 147 places, 217 transitions, 4272 flow. Second operand 16 states and 137 transitions. [2022-12-06 05:50:05,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 299 transitions, 6100 flow [2022-12-06 05:50:05,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 299 transitions, 5156 flow, removed 378 selfloop flow, removed 11 redundant places. [2022-12-06 05:50:05,792 INFO L231 Difference]: Finished difference. Result has 160 places, 270 transitions, 4699 flow [2022-12-06 05:50:05,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=3517, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4699, PETRI_PLACES=160, PETRI_TRANSITIONS=270} [2022-12-06 05:50:05,792 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 139 predicate places. [2022-12-06 05:50:05,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:05,792 INFO L89 Accepts]: Start accepts. Operand has 160 places, 270 transitions, 4699 flow [2022-12-06 05:50:05,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:05,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:05,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 270 transitions, 4699 flow [2022-12-06 05:50:05,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 270 transitions, 4699 flow [2022-12-06 05:50:05,917 INFO L130 PetriNetUnfolder]: 241/813 cut-off events. [2022-12-06 05:50:05,917 INFO L131 PetriNetUnfolder]: For 12061/12067 co-relation queries the response was YES. [2022-12-06 05:50:05,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5835 conditions, 813 events. 241/813 cut-off events. For 12061/12067 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5966 event pairs, 5 based on Foata normal form. 2/807 useless extension candidates. Maximal degree in co-relation 5536. Up to 245 conditions per place. [2022-12-06 05:50:05,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 270 transitions, 4699 flow [2022-12-06 05:50:05,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 05:50:06,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:50:07,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:50:11,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:50:11,922 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:50:11,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6130 [2022-12-06 05:50:11,923 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 269 transitions, 4763 flow [2022-12-06 05:50:11,923 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:50:11,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:11,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:11,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-06 05:50:12,123 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,SelfDestructingSolverStorable53 [2022-12-06 05:50:12,123 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:50:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1486119477, now seen corresponding path program 1 times [2022-12-06 05:50:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020491284] [2022-12-06 05:50:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:12,207 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:12,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:12,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020491284] [2022-12-06 05:50:12,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020491284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:12,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547644339] [2022-12-06 05:50:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:12,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:12,209 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:50:12,211 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:50:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:12,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:50:12,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:12,513 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:12,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:12,546 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:12,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547644339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:12,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:12,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:50:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002889169] [2022-12-06 05:50:12,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:12,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:50:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:12,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:50:12,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:50:12,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 05:50:12,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 269 transitions, 4763 flow. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:12,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:12,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 05:50:12,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:13,618 INFO L130 PetriNetUnfolder]: 950/1904 cut-off events. [2022-12-06 05:50:13,618 INFO L131 PetriNetUnfolder]: For 31238/31238 co-relation queries the response was YES. [2022-12-06 05:50:13,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15482 conditions, 1904 events. 950/1904 cut-off events. For 31238/31238 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11862 event pairs, 340 based on Foata normal form. 32/1930 useless extension candidates. Maximal degree in co-relation 14829. Up to 1763 conditions per place. [2022-12-06 05:50:13,636 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 250 selfloop transitions, 44 changer transitions 5/299 dead transitions. [2022-12-06 05:50:13,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 299 transitions, 5920 flow [2022-12-06 05:50:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:50:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:50:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-12-06 05:50:13,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15954415954415954 [2022-12-06 05:50:13,637 INFO L175 Difference]: Start difference. First operand has 159 places, 269 transitions, 4763 flow. Second operand 9 states and 112 transitions. [2022-12-06 05:50:13,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 299 transitions, 5920 flow [2022-12-06 05:50:13,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 299 transitions, 5660 flow, removed 115 selfloop flow, removed 2 redundant places. [2022-12-06 05:50:13,822 INFO L231 Difference]: Finished difference. Result has 168 places, 281 transitions, 4960 flow [2022-12-06 05:50:13,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=4503, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4960, PETRI_PLACES=168, PETRI_TRANSITIONS=281} [2022-12-06 05:50:13,823 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 147 predicate places. [2022-12-06 05:50:13,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:13,823 INFO L89 Accepts]: Start accepts. Operand has 168 places, 281 transitions, 4960 flow [2022-12-06 05:50:13,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:13,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:13,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 281 transitions, 4960 flow [2022-12-06 05:50:13,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 281 transitions, 4960 flow [2022-12-06 05:50:13,957 INFO L130 PetriNetUnfolder]: 251/839 cut-off events. [2022-12-06 05:50:13,957 INFO L131 PetriNetUnfolder]: For 14035/14041 co-relation queries the response was YES. [2022-12-06 05:50:13,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6285 conditions, 839 events. 251/839 cut-off events. For 14035/14041 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6189 event pairs, 5 based on Foata normal form. 2/831 useless extension candidates. Maximal degree in co-relation 5984. Up to 239 conditions per place. [2022-12-06 05:50:13,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 281 transitions, 4960 flow [2022-12-06 05:50:13,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 05:50:13,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [887] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_617| v_~f~0.base_474))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_470 (* v_~x2~0_643 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_470 (* .cse3 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_470 (* .cse5 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_470 (* .cse4 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_470 (* .cse2 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_643) (< v_~x2~0_643 v_~size~0_471)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| (ite (and (< .cse0 v_~size~0_471) (<= 0 .cse0)) 1 0)) (= (select .cse1 (+ (* .cse0 4) v_~f~0.offset_470)) v_~x2~0_641) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_525|) (= (select .cse1 (+ v_~f~0.offset_470 (* v_~x1~0_930 4))) v_~x1~0_929) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528| 0)) (not (= (ite (and (< .cse2 v_~size~0_471) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_471)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_512| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_471)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_400|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_512| (ite (and (<= 0 v_~x1~0_930) (< v_~x1~0_930 v_~size~0_471)) 1 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_525| 4294967293) 4294967296) (mod (* 3 v_~n~0_461) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_722| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_400| 0)) (not (= (ite (and (< .cse5 v_~size~0_471) (<= 0 .cse5)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_643, ~size~0=v_~size~0_471, ~f~0.base=v_~f~0.base_474, #memory_int=|v_#memory_int_617|, ~n~0=v_~n~0_461, ~x1~0=v_~x1~0_930, ~f~0.offset=v_~f~0.offset_470} OutVars{~x2~0=v_~x2~0_641, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_520|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_360|, ~size~0=v_~size~0_471, ~f~0.base=v_~f~0.base_474, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_332|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_525|, ~x1~0=v_~x1~0_929, ~f~0.offset=v_~f~0.offset_470, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_400|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_512|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_324|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_722|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_322|, #memory_int=|v_#memory_int_617|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_332|, ~n~0=v_~n~0_461, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_336|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_530|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:50:15,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [891] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_621| v_~f~0.base_478))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_474 (* v_~x2~0_655 4))))) (let ((.cse10 (select .cse8 (+ v_~f~0.offset_474 (* .cse6 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_474 (* .cse10 4))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_474 (* .cse5 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_474 (* .cse0 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_474 (* .cse3 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_474 (* v_~x1~0_941 4)))) (.cse7 (select .cse8 (+ v_~f~0.offset_474 (* .cse2 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_474 (* .cse7 4)))) (.cse1 (select .cse8 (+ v_~f~0.offset_474 (* 4 .cse9))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_475)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_475)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_518|) (not (= (ite (and (< .cse2 v_~size~0_475) (<= 0 .cse2)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_518| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_534|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_475)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| (ite (and (< .cse4 v_~size~0_475) (<= 0 .cse4)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_534| 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_533|) (not (= (ite (and (< v_~x2~0_655 v_~size~0_475) (<= 0 v_~x2~0_655)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_475)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_475)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_475)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|) (= v_~x2~0_653 (select .cse8 (+ v_~f~0.offset_474 (* .cse4 4)))) (= (select .cse8 (+ v_~f~0.offset_474 (* 4 .cse1))) v_~x1~0_939) (not (= (ite (and (<= 0 v_~x1~0_941) (< v_~x1~0_941 v_~size~0_475)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_475)) 1 0))) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_533| 4294967293) 4294967296) (mod (* 3 v_~n~0_465) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408| 0)) (not (= (ite (and (< .cse10 v_~size~0_475) (<= 0 .cse10)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_728| 3))))))))))) InVars {~x2~0=v_~x2~0_655, ~size~0=v_~size~0_475, ~f~0.base=v_~f~0.base_478, #memory_int=|v_#memory_int_621|, ~n~0=v_~n~0_465, ~x1~0=v_~x1~0_941, ~f~0.offset=v_~f~0.offset_474} OutVars{~x2~0=v_~x2~0_653, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_526|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_368|, ~size~0=v_~size~0_475, ~f~0.base=v_~f~0.base_478, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_340|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_533|, ~x1~0=v_~x1~0_939, ~f~0.offset=v_~f~0.offset_474, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_518|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_332|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_728|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_330|, #memory_int=|v_#memory_int_621|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_534|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_340|, ~n~0=v_~n~0_465, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_344|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_536|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 05:50:19,533 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:50:19,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:19,732 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 13 out of bounds for length 13 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:50:19,735 INFO L158 Benchmark]: Toolchain (without parser) took 346451.92ms. Allocated memory was 186.6MB in the beginning and 973.1MB in the end (delta: 786.4MB). Free memory was 162.8MB in the beginning and 530.6MB in the end (delta: -367.8MB). Peak memory consumption was 603.2MB. Max. memory is 8.0GB. [2022-12-06 05:50:19,735 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:50:19,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.96ms. Allocated memory is still 186.6MB. Free memory was 162.8MB in the beginning and 151.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:50:19,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.05ms. Allocated memory is still 186.6MB. Free memory was 151.3MB in the beginning and 149.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:50:19,736 INFO L158 Benchmark]: Boogie Preprocessor took 22.43ms. Allocated memory is still 186.6MB. Free memory was 149.4MB in the beginning and 147.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:50:19,736 INFO L158 Benchmark]: RCFGBuilder took 425.23ms. Allocated memory is still 186.6MB. Free memory was 147.7MB in the beginning and 131.5MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 05:50:19,736 INFO L158 Benchmark]: TraceAbstraction took 345674.57ms. Allocated memory was 186.6MB in the beginning and 973.1MB in the end (delta: 786.4MB). Free memory was 130.9MB in the beginning and 530.6MB in the end (delta: -399.7MB). Peak memory consumption was 570.7MB. Max. memory is 8.0GB. [2022-12-06 05:50:19,737 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 127.9MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.96ms. Allocated memory is still 186.6MB. Free memory was 162.8MB in the beginning and 151.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.05ms. Allocated memory is still 186.6MB. Free memory was 151.3MB in the beginning and 149.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.43ms. Allocated memory is still 186.6MB. Free memory was 149.4MB in the beginning and 147.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 425.23ms. Allocated memory is still 186.6MB. Free memory was 147.7MB in the beginning and 131.5MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 345674.57ms. Allocated memory was 186.6MB in the beginning and 973.1MB in the end (delta: 786.4MB). Free memory was 130.9MB in the beginning and 530.6MB in the end (delta: -399.7MB). Peak memory consumption was 570.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 149 PlacesBefore, 21 PlacesAfterwards, 157 TransitionsBefore, 17 TransitionsAfterwards, 2592 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 59 ConcurrentYvCompositions, 12 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 1609, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1612, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1538, unknown conditional: 0, unknown unconditional: 1538] , Statistics on independence cache: Total cache size (in pairs): 3041, Positive cache size: 3038, Positive conditional cache size: 0, Positive unconditional cache size: 3038, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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.6s, 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, 78 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: 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] , 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: 21, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, 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, 56 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): 6, Positive cache size: 6, Positive conditional cache size: 0, 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): 15, Positive cache size: 15, Positive conditional cache size: 1, 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): 15, Positive cache size: 15, Positive conditional cache size: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], 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): 16, Positive cache size: 15, Positive conditional cache size: 1, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 1, 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, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 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: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, 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): 20, Positive cache size: 18, Positive conditional cache size: 4, 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.5s, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, 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: 13, independent: 9, independent conditional: 9, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 5, Negative conditional cache size: 5, 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, 28 TransitionsBefore, 28 TransitionsAfterwards, 88 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): 29, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 5, Negative conditional cache size: 5, 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, 43 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 32, Positive conditional cache size: 17, Positive unconditional cache size: 15, Negative cache size: 5, Negative conditional cache size: 5, 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.5s, 57 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 41 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 54, Positive conditional cache size: 39, Positive unconditional cache size: 15, Negative cache size: 8, Negative conditional cache size: 8, 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, 49 PlacesBefore, 49 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 54, Positive conditional cache size: 39, Positive unconditional cache size: 15, Negative cache size: 8, Negative conditional cache size: 8, 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.8s, 58 PlacesBefore, 56 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 8, independent conditional: 8, 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): 66, Positive cache size: 58, Positive conditional cache size: 43, Positive unconditional cache size: 15, Negative cache size: 8, Negative conditional cache size: 8, 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, 68 PlacesBefore, 68 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 15, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 71, Positive conditional cache size: 55, Positive unconditional cache size: 16, Negative cache size: 8, Negative conditional cache size: 8, 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, 69 PlacesBefore, 69 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 318 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): 94, Positive cache size: 86, Positive conditional cache size: 69, Positive unconditional cache size: 17, Negative cache size: 8, Negative conditional cache size: 8, 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, 76 PlacesBefore, 76 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 376 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): 97, Positive cache size: 89, Positive conditional cache size: 72, Positive unconditional cache size: 17, Negative cache size: 8, Negative conditional cache size: 8, 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, 82 PlacesBefore, 81 PlacesAfterwards, 113 TransitionsBefore, 112 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 2, independent unconditional: 1, 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: 2, independent unconditional: 1, 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: 2, independent unconditional: 1, 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: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 92, Positive conditional cache size: 74, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 87 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 412 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: 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): 101, Positive cache size: 93, Positive conditional cache size: 75, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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, 100 PlacesBefore, 100 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 9, independent conditional: 9, 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): 104, Positive cache size: 96, Positive conditional cache size: 78, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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, 109 PlacesBefore, 109 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 448 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: 96, Positive conditional cache size: 78, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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, 105 PlacesBefore, 105 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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] , 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: 8, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 103, Positive conditional cache size: 85, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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.8s, 106 PlacesBefore, 106 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 404 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): 112, Positive cache size: 104, Positive conditional cache size: 86, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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.6s, 103 PlacesBefore, 103 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 4, independent conditional: 4, 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): 121, Positive cache size: 113, Positive conditional cache size: 93, Positive unconditional cache size: 20, Negative cache size: 8, Negative conditional cache size: 8, 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, 97 PlacesBefore, 97 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 362 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): 121, Positive cache size: 113, Positive conditional cache size: 93, Positive unconditional cache size: 20, Negative cache size: 8, Negative conditional cache size: 8, 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, 102 PlacesBefore, 102 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 368 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): 121, Positive cache size: 113, Positive conditional cache size: 93, Positive unconditional cache size: 20, Negative cache size: 8, Negative conditional cache size: 8, 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: 5.9s, 114 PlacesBefore, 114 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 131, Positive cache size: 123, Positive conditional cache size: 102, Positive unconditional cache size: 21, Negative cache size: 8, Negative conditional cache size: 8, 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, 115 PlacesBefore, 114 PlacesAfterwards, 129 TransitionsBefore, 128 TransitionsAfterwards, 380 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 123, Positive conditional cache size: 102, Positive unconditional cache size: 21, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 116 PlacesBefore, 116 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 344 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 126, Positive conditional cache size: 103, Positive unconditional cache size: 23, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 330 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): 134, Positive cache size: 126, Positive conditional cache size: 103, Positive unconditional cache size: 23, Negative cache size: 8, Negative conditional cache size: 8, 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, 110 PlacesBefore, 110 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 324 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): 134, Positive cache size: 126, Positive conditional cache size: 103, Positive unconditional cache size: 23, Negative cache size: 8, Negative conditional cache size: 8, 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, 113 PlacesBefore, 109 PlacesAfterwards, 98 TransitionsBefore, 95 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 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: 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] , 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 133, Positive conditional cache size: 110, Positive unconditional cache size: 23, Negative cache size: 8, Negative conditional cache size: 8, 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, 98 PlacesBefore, 98 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 284 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): 141, Positive cache size: 133, Positive conditional cache size: 110, Positive unconditional cache size: 23, Negative cache size: 8, Negative conditional cache size: 8, 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: 4.6s, 108 PlacesBefore, 111 PlacesAfterwards, 123 TransitionsBefore, 124 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 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: 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: 16, independent: 10, independent conditional: 10, 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): 149, Positive cache size: 141, Positive conditional cache size: 117, Positive unconditional cache size: 24, Negative cache size: 8, Negative conditional cache size: 8, 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, 97 PlacesBefore, 97 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 376 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: 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): 151, Positive cache size: 143, Positive conditional cache size: 118, Positive unconditional cache size: 25, Negative cache size: 8, Negative conditional cache size: 8, 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, 101 PlacesBefore, 99 PlacesAfterwards, 118 TransitionsBefore, 116 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 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: 3, independent: 2, independent conditional: 2, 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): 152, Positive cache size: 144, Positive conditional cache size: 119, Positive unconditional cache size: 25, Negative cache size: 8, Negative conditional cache size: 8, 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, 97 PlacesBefore, 96 PlacesAfterwards, 117 TransitionsBefore, 116 TransitionsAfterwards, 374 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): 153, Positive cache size: 145, Positive conditional cache size: 120, Positive unconditional cache size: 25, Negative cache size: 8, Negative conditional cache size: 8, 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, 98 PlacesBefore, 98 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 372 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): 153, Positive cache size: 145, Positive conditional cache size: 120, Positive unconditional cache size: 25, Negative cache size: 8, Negative conditional cache size: 8, 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, 91 PlacesBefore, 90 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 288 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): 153, Positive cache size: 145, Positive conditional cache size: 120, Positive unconditional cache size: 25, Negative cache size: 8, Negative conditional cache size: 8, 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.3s, 87 PlacesBefore, 87 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 159, Positive cache size: 151, Positive conditional cache size: 124, Positive unconditional cache size: 27, Negative cache size: 8, Negative conditional cache size: 8, 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, 83 PlacesBefore, 82 PlacesAfterwards, 79 TransitionsBefore, 78 TransitionsAfterwards, 278 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): 159, Positive cache size: 151, Positive conditional cache size: 124, Positive unconditional cache size: 27, Negative cache size: 8, Negative conditional cache size: 8, 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: 19.8s, 92 PlacesBefore, 91 PlacesAfterwards, 87 TransitionsBefore, 86 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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): 178, Positive cache size: 170, Positive conditional cache size: 140, Positive unconditional cache size: 30, Negative cache size: 8, Negative conditional cache size: 8, 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, 80 PlacesBefore, 80 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 264 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): 180, Positive cache size: 172, Positive conditional cache size: 142, Positive unconditional cache size: 30, Negative cache size: 8, Negative conditional cache size: 8, 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.6s, 83 PlacesBefore, 83 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 11, independent: 5, independent conditional: 5, 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): 286, Positive cache size: 278, Positive conditional cache size: 245, Positive unconditional cache size: 33, Negative cache size: 8, Negative conditional cache size: 8, 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, 89 PlacesBefore, 89 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 314 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): 326, Positive cache size: 318, Positive conditional cache size: 284, Positive unconditional cache size: 34, Negative cache size: 8, Negative conditional cache size: 8, 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, 98 PlacesBefore, 96 PlacesAfterwards, 122 TransitionsBefore, 121 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 114, independent conditional: 114, 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: 114, independent: 114, independent conditional: 30, independent unconditional: 84, 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: 114, independent: 114, independent conditional: 30, independent unconditional: 84, 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: 114, independent: 114, independent conditional: 30, independent unconditional: 84, 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: 2, independent unconditional: 2, 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: 114, independent: 110, independent conditional: 28, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 322, Positive conditional cache size: 286, Positive unconditional cache size: 36, Negative cache size: 8, Negative conditional cache size: 8, 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.1s, 100 PlacesBefore, 100 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 346 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): 364, Positive cache size: 356, Positive conditional cache size: 319, Positive unconditional cache size: 37, Negative cache size: 8, Negative conditional cache size: 8, 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, 106 PlacesBefore, 106 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 11, independent: 8, independent conditional: 8, 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): 409, Positive cache size: 401, Positive conditional cache size: 363, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 8, 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, 110 PlacesBefore, 110 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 360 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): 409, Positive cache size: 401, Positive conditional cache size: 363, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 8, 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, 113 PlacesBefore, 113 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 386 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): 413, Positive cache size: 405, Positive conditional cache size: 367, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 8, 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, 128 PlacesBefore, 128 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 416 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): 413, Positive cache size: 405, Positive conditional cache size: 367, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 8, 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: 5.6s, 135 PlacesBefore, 135 PlacesAfterwards, 179 TransitionsBefore, 179 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 7, independent: 6, independent conditional: 6, 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): 414, Positive cache size: 406, Positive conditional cache size: 368, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 8, 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, 147 PlacesBefore, 147 PlacesAfterwards, 217 TransitionsBefore, 217 TransitionsAfterwards, 534 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): 414, Positive cache size: 406, Positive conditional cache size: 368, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 8, 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: 6.0s, 160 PlacesBefore, 159 PlacesAfterwards, 270 TransitionsBefore, 269 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 8, independent conditional: 8, 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): 464, Positive cache size: 456, Positive conditional cache size: 415, Positive unconditional cache size: 41, Negative cache size: 8, Negative conditional cache size: 8, 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 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 13 out of bounds for length 13 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 13 out of bounds for length 13: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:50:19,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...