/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:24:53,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:24:53,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:24:53,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:24:53,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:24:53,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:24:53,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:24:53,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:24:53,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:24:53,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:24:53,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:24:53,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:24:53,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:24:53,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:24:53,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:24:53,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:24:53,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:24:53,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:24:53,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:24:53,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:24:53,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:24:53,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:24:53,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:24:53,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:24:53,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:24:53,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:24:53,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:24:53,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:24:53,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:24:53,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:24:53,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:24:53,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:24:53,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:24:53,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:24:53,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:24:53,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:24:53,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:24:53,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:24:53,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:24:53,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:24:53,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:24:53,688 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-RepeatedSemanticLbe.epf [2022-12-13 02:24:53,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:24:53,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:24:53,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:24:53,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:24:53,721 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:24:53,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:24:53,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:24:53,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:24:53,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:24:53,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:24:53,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:24:53,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:24:53,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:24:53,723 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:24:53,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:24:53,723 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:24:53,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:24:53,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:24:53,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:24:53,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:24:53,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:24:53,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:24:53,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:24:53,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:24:53,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:24:53,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:24:53,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:24:53,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:24:53,725 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-13 02:24:54,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:24:54,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:24:54,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:24:54,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:24:54,058 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:24:54,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-13 02:24:55,123 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:24:55,302 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:24:55,302 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-13 02:24:55,314 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660de6152/ab947e769ec54d8aa76855c718af6af5/FLAGeb0ed84e3 [2022-12-13 02:24:55,334 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660de6152/ab947e769ec54d8aa76855c718af6af5 [2022-12-13 02:24:55,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:24:55,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:24:55,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:24:55,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:24:55,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:24:55,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df00ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55, skipping insertion in model container [2022-12-13 02:24:55,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:24:55,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:24:55,538 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-13 02:24:55,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:24:55,554 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:24:55,588 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-13 02:24:55,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:24:55,605 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:24:55,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55 WrapperNode [2022-12-13 02:24:55,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:24:55,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:24:55,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:24:55,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:24:55,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,660 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-13 02:24:55,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:24:55,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:24:55,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:24:55,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:24:55,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,696 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:24:55,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:24:55,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:24:55,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:24:55,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (1/1) ... [2022-12-13 02:24:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:24:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:24:55,740 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-13 02:24:55,759 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-13 02:24:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:24:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:24:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:24:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:24:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:24:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:24:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:24:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:24:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:24:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:24:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:24:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:24:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:24:55,784 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 02:24:55,892 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:24:55,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:24:56,219 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:24:56,227 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:24:56,227 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 02:24:56,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:56 BoogieIcfgContainer [2022-12-13 02:24:56,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:24:56,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:24:56,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:24:56,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:24:56,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:24:55" (1/3) ... [2022-12-13 02:24:56,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd4ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:24:56, skipping insertion in model container [2022-12-13 02:24:56,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:55" (2/3) ... [2022-12-13 02:24:56,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd4ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:24:56, skipping insertion in model container [2022-12-13 02:24:56,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:56" (3/3) ... [2022-12-13 02:24:56,249 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-13 02:24:56,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:24:56,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:24:56,266 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:24:56,379 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:24:56,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 02:24:56,509 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-13 02:24:56,509 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:24:56,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 14/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 02:24:56,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 02:24:56,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-13 02:24:56,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:56,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 02:24:56,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-13 02:24:56,605 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-13 02:24:56,605 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:24:56,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 14/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 02:24:56,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 02:24:56,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-13 02:25:00,734 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 02:25:00,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:25:00,752 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;@41b9adcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:25:00,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 02:25:00,756 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 02:25:00,756 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:25:00,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:00,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:00,758 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-13 02:25:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-13 02:25:00,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:00,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33100341] [2022-12-13 02:25:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:01,127 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-13 02:25:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33100341] [2022-12-13 02:25:01,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33100341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:01,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:01,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:25:01,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64176941] [2022-12-13 02:25:01,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:01,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:01,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:01,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 02:25:01,156 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-13 02:25:01,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:01,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 02:25:01,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:01,212 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-13 02:25:01,212 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 02:25:01,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-13 02:25:01,215 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 02:25:01,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 02:25:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 02:25:01,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 02:25:01,226 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-13 02:25:01,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 02:25:01,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:01,229 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:01,230 INFO L277 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-13 02:25:01,233 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 02:25:01,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:01,234 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:01,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:01,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:01,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:01,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:01,241 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 02:25:01,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:25:01,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-13 02:25:01,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:01,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 02:25:02,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:02,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1021 [2022-12-13 02:25:02,254 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-13 02:25:02,254 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-13 02:25:02,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:02,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:02,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:25:02,255 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-13 02:25:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-13 02:25:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:02,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739279659] [2022-12-13 02:25:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:02,530 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-13 02:25:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:02,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739279659] [2022-12-13 02:25:02,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739279659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:02,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:02,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:25:02,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941655187] [2022-12-13 02:25:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:02,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:02,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 02:25:02,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:02,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:02,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 02:25:02,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:02,593 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-13 02:25:02,593 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:25:02,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-13 02:25:02,596 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 02:25:02,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-13 02:25:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 02:25:02,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 02:25:02,598 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-13 02:25:02,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-13 02:25:02,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:02,599 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:02,599 INFO L277 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-13 02:25:02,600 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 02:25:02,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:02,600 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:02,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:02,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:02,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:02,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:02,605 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-13 02:25:02,606 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:25:02,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-13 02:25:02,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:02,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 02:25:02,610 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:02,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 02:25:02,612 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:02,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:02,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:02,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:02,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:25:02,613 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-13 02:25:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash 166108600, now seen corresponding path program 1 times [2022-12-13 02:25:02,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:02,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933894802] [2022-12-13 02:25:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:02,787 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-13 02:25:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:02,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933894802] [2022-12-13 02:25:02,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933894802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:02,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:02,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:25:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540007029] [2022-12-13 02:25:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:02,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:02,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 02:25:02,789 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-13 02:25:02,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:02,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 02:25:02,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:02,882 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-13 02:25:02,883 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 02:25:02,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 169 events. 87/169 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 517 event pairs, 30 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 132. Up to 98 conditions per place. [2022-12-13 02:25:02,884 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 6/40 dead transitions. [2022-12-13 02:25:02,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 40 transitions, 193 flow [2022-12-13 02:25:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-13 02:25:02,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-13 02:25:02,886 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 39 transitions. [2022-12-13 02:25:02,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 40 transitions, 193 flow [2022-12-13 02:25:02,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 40 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:02,904 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-13 02:25:02,905 INFO L277 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-13 02:25:02,906 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 02:25:02,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:02,907 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-13 02:25:02,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:02,913 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:02,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-13 02:25:02,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-13 02:25:02,921 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-13 02:25:02,921 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 02:25:02,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 34 events. 7/34 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 46. Up to 11 conditions per place. [2022-12-13 02:25:02,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-13 02:25:02,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 02:25:03,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:03,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-13 02:25:03,139 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-13 02:25:03,140 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-13 02:25:03,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:03,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:03,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:25:03,140 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-13 02:25:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1536303008, now seen corresponding path program 1 times [2022-12-13 02:25:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:03,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633724994] [2022-12-13 02:25:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:03,286 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-13 02:25:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:03,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633724994] [2022-12-13 02:25:03,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633724994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:03,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009616313] [2022-12-13 02:25:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:03,293 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-13 02:25:03,318 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-13 02:25:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:03,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:03,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:03,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:03,453 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-13 02:25:03,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009616313] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:03,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 02:25:03,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-13 02:25:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808233815] [2022-12-13 02:25:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:03,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:03,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:03,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:03,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 02:25:03,455 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-13 02:25:03,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:03,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 02:25:03,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,502 INFO L130 PetriNetUnfolder]: 59/109 cut-off events. [2022-12-13 02:25:03,502 INFO L131 PetriNetUnfolder]: For 168/174 co-relation queries the response was YES. [2022-12-13 02:25:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 109 events. 59/109 cut-off events. For 168/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 299 event pairs, 10 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 203. Up to 76 conditions per place. [2022-12-13 02:25:03,503 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-12-13 02:25:03,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-13 02:25:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 02:25:03,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 02:25:03,504 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-13 02:25:03,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-13 02:25:03,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 27 transitions, 135 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 02:25:03,506 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-13 02:25:03,506 INFO L277 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-13 02:25:03,507 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 02:25:03,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,507 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-13 02:25:03,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-13 02:25:03,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-13 02:25:03,512 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-13 02:25:03,512 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 02:25:03,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 27 events. 7/27 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-13 02:25:03,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-13 02:25:03,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 02:25:03,513 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:03,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 02:25:03,514 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-13 02:25:03,514 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-13 02:25:03,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:03,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:03,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:03,720 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-13 02:25:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -774279310, now seen corresponding path program 1 times [2022-12-13 02:25:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:03,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56132359] [2022-12-13 02:25:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:03,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:03,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56132359] [2022-12-13 02:25:03,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56132359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:03,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:03,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564695821] [2022-12-13 02:25:03,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:03,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:03,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:03,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:03,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:03,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 02:25:03,810 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-13 02:25:03,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:03,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 02:25:03,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,898 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-13 02:25:03,898 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-13 02:25:03,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 119 events. 61/119 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 308 event pairs, 20 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 125. Up to 76 conditions per place. [2022-12-13 02:25:03,899 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-13 02:25:03,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 184 flow [2022-12-13 02:25:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 02:25:03,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 02:25:03,901 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-13 02:25:03,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 35 transitions, 184 flow [2022-12-13 02:25:03,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 35 transitions, 169 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:03,906 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:03,906 INFO L277 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-13 02:25:03,909 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 02:25:03,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,909 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:03,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:03,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:03,917 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-13 02:25:03,917 INFO L131 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2022-12-13 02:25:03,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 31 events. 6/31 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 39. Up to 9 conditions per place. [2022-12-13 02:25:03,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:03,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 02:25:04,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:04,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 02:25:04,155 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-13 02:25:04,156 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-13 02:25:04,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:25:04,156 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-13 02:25:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1396315567, now seen corresponding path program 1 times [2022-12-13 02:25:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477117986] [2022-12-13 02:25:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:04,227 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-13 02:25:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477117986] [2022-12-13 02:25:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477117986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:04,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:04,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387712034] [2022-12-13 02:25:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:04,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:04,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:04,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 02:25:04,231 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-13 02:25:04,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:04,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 02:25:04,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:04,290 INFO L130 PetriNetUnfolder]: 44/84 cut-off events. [2022-12-13 02:25:04,295 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-13 02:25:04,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 84 events. 44/84 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 179 event pairs, 11 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 165. Up to 68 conditions per place. [2022-12-13 02:25:04,297 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 3/25 dead transitions. [2022-12-13 02:25:04,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 143 flow [2022-12-13 02:25:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 02:25:04,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 02:25:04,299 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 26 transitions. [2022-12-13 02:25:04,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 143 flow [2022-12-13 02:25:04,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 126 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:04,302 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-13 02:25:04,302 INFO L277 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-13 02:25:04,305 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 02:25:04,305 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:04,305 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-13 02:25:04,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:04,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:04,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-13 02:25:04,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-13 02:25:04,310 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-13 02:25:04,310 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 02:25:04,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 6/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 9 conditions per place. [2022-12-13 02:25:04,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-13 02:25:04,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 02:25:04,311 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:04,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 02:25:04,312 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-13 02:25:04,312 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-13 02:25:04,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:25:04,313 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-13 02:25:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1385749717, now seen corresponding path program 1 times [2022-12-13 02:25:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073510816] [2022-12-13 02:25:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:04,386 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-13 02:25:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:04,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073510816] [2022-12-13 02:25:04,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073510816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:04,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:04,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865288213] [2022-12-13 02:25:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:04,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:04,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:25:04,389 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-13 02:25:04,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:04,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:25:04,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:04,470 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-13 02:25:04,470 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 02:25:04,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 119 events. 61/119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 316 event pairs, 16 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 265. Up to 76 conditions per place. [2022-12-13 02:25:04,471 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-13 02:25:04,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 176 flow [2022-12-13 02:25:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 02:25:04,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-13 02:25:04,474 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-13 02:25:04,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 176 flow [2022-12-13 02:25:04,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:04,476 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 87 flow [2022-12-13 02:25:04,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-13 02:25:04,476 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 02:25:04,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:04,477 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 87 flow [2022-12-13 02:25:04,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:04,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:04,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-13 02:25:04,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 87 flow [2022-12-13 02:25:04,482 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-13 02:25:04,482 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 02:25:04,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 37 events. 8/37 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 53. Up to 13 conditions per place. [2022-12-13 02:25:04,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-13 02:25:04,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 02:25:04,484 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:04,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 02:25:04,486 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 87 flow [2022-12-13 02:25:04,486 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-13 02:25:04,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:25:04,487 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-13 02:25:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1328554519, now seen corresponding path program 2 times [2022-12-13 02:25:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429318920] [2022-12-13 02:25:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:04,571 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-13 02:25:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:04,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429318920] [2022-12-13 02:25:04,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429318920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:04,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:04,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935408375] [2022-12-13 02:25:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:04,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:04,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:25:04,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:04,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:04,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:25:04,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:04,653 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-13 02:25:04,653 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 02:25:04,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 94 events. 52/94 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 148. Up to 76 conditions per place. [2022-12-13 02:25:04,654 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2022-12-13 02:25:04,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 154 flow [2022-12-13 02:25:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 02:25:04,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 02:25:04,657 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 87 flow. Second operand 3 states and 27 transitions. [2022-12-13 02:25:04,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 154 flow [2022-12-13 02:25:04,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 141 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:04,660 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2022-12-13 02:25:04,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-13 02:25:04,662 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 02:25:04,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:04,662 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 78 flow [2022-12-13 02:25:04,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:04,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:04,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-13 02:25:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 78 flow [2022-12-13 02:25:04,667 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-13 02:25:04,667 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 02:25:04,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 8/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-13 02:25:04,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-13 02:25:04,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 02:25:04,677 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:04,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 02:25:04,680 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-13 02:25:04,680 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-13 02:25:04,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 02:25:04,681 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-13 02:25:04,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2064777642, now seen corresponding path program 1 times [2022-12-13 02:25:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168790172] [2022-12-13 02:25:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,082 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-13 02:25:05,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168790172] [2022-12-13 02:25:05,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168790172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:05,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363360219] [2022-12-13 02:25:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:05,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:05,085 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-13 02:25:05,111 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-13 02:25:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 02:25:05,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:05,210 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-13 02:25:05,246 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-13 02:25:05,275 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-13 02:25:05,400 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-13 02:25:05,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 35 [2022-12-13 02:25:05,420 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-13 02:25:05,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:05,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (< .cse0 0) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (= (select .cse1 (+ c_~f~0.offset (* .cse0 4))) (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset))))))) is different from false [2022-12-13 02:25:05,646 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-13 02:25:05,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363360219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:05,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:05,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 02:25:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810977990] [2022-12-13 02:25:05,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:05,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:25:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:25:05,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2022-12-13 02:25:05,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:25:05,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:05,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:05,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:25:05,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:06,212 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2022-12-13 02:25:06,212 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 02:25:06,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 218 events. 121/218 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 682 event pairs, 14 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 110. Up to 105 conditions per place. [2022-12-13 02:25:06,214 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 20 selfloop transitions, 4 changer transitions 37/61 dead transitions. [2022-12-13 02:25:06,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 61 transitions, 343 flow [2022-12-13 02:25:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:25:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:25:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-13 02:25:06,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-13 02:25:06,218 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 9 states and 60 transitions. [2022-12-13 02:25:06,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 61 transitions, 343 flow [2022-12-13 02:25:06,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 61 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:06,220 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 100 flow [2022-12-13 02:25:06,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 02:25:06,221 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 02:25:06,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:06,221 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 100 flow [2022-12-13 02:25:06,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:06,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:06,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 100 flow [2022-12-13 02:25:06,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 100 flow [2022-12-13 02:25:06,231 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-13 02:25:06,231 INFO L131 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2022-12-13 02:25:06,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 30 events. 8/30 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 71. Up to 13 conditions per place. [2022-12-13 02:25:06,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 100 flow [2022-12-13 02:25:06,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 02:25:07,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:07,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1052 [2022-12-13 02:25:07,274 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 96 flow [2022-12-13 02:25:07,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:07,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:07,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:07,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 02:25:07,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 02:25:07,479 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-13 02:25:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -380380717, now seen corresponding path program 1 times [2022-12-13 02:25:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:07,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620942218] [2022-12-13 02:25:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:08,409 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-13 02:25:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:08,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620942218] [2022-12-13 02:25:08,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620942218] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:08,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999847445] [2022-12-13 02:25:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:08,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:08,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:08,412 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-13 02:25:08,443 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-13 02:25:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:08,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 02:25:08,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:08,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:08,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 02:25:08,612 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-13 02:25:08,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:08,689 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-13 02:25:08,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-13 02:25:08,765 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-13 02:25:08,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999847445] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:08,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:08,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-13 02:25:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852581822] [2022-12-13 02:25:08,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:08,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 02:25:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 02:25:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 02:25:08,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:25:08,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 96 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:08,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:08,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:25:08,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:09,238 INFO L130 PetriNetUnfolder]: 139/255 cut-off events. [2022-12-13 02:25:09,238 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-13 02:25:09,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 255 events. 139/255 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 788 event pairs, 10 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 845. Up to 118 conditions per place. [2022-12-13 02:25:09,240 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 57 selfloop transitions, 25 changer transitions 1/83 dead transitions. [2022-12-13 02:25:09,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 507 flow [2022-12-13 02:25:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:25:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:25:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2022-12-13 02:25:09,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36403508771929827 [2022-12-13 02:25:09,241 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 96 flow. Second operand 12 states and 83 transitions. [2022-12-13 02:25:09,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 507 flow [2022-12-13 02:25:09,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 83 transitions, 437 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-13 02:25:09,244 INFO L231 Difference]: Finished difference. Result has 36 places, 44 transitions, 246 flow [2022-12-13 02:25:09,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=246, PETRI_PLACES=36, PETRI_TRANSITIONS=44} [2022-12-13 02:25:09,245 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 02:25:09,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:09,245 INFO L89 Accepts]: Start accepts. Operand has 36 places, 44 transitions, 246 flow [2022-12-13 02:25:09,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:09,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:09,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-13 02:25:09,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 44 transitions, 246 flow [2022-12-13 02:25:09,280 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-13 02:25:09,281 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-13 02:25:09,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 85 events. 24/85 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 167. Up to 36 conditions per place. [2022-12-13 02:25:09,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-13 02:25:09,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 02:25:09,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:09,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 02:25:10,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 02:25:10,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:10,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (<= 0 v_~x1~0_147) (< v_~x1~0_147 v_~size~0_116)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (store |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47| (store (select |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre12#1_54|)) |v_#memory_int_171|) (= (select (select |v_#memory_int_172| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~x1~0_147 4))) v_~x1~0_146) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_128| 1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_128| 4294967295) 4294967296) (* (mod v_~n~0_115 2147483648) 2)) (= |v_ULTIMATE.start_main_#t~pre12#1_54| |v_#pthreadsForks_68|) (= |v_#pthreadsForks_67| (+ |v_#pthreadsForks_68| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_68|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_172|, ~n~0=v_~n~0_115, ~x1~0=v_~x1~0_147, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ~f~0.offset=v_~f~0.offset_104} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, ~x1~0=v_~x1~0_146, ~f~0.offset=v_~f~0.offset_104, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_54|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_43|, #pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_57|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_128|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, ~n~0=v_~n~0_115, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:10,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_175| v_~f~0.base_106))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_106 (* v_~x2~0_116 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (ite (and (< .cse0 v_~size~0_118) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= v_~x1~0_150 (select .cse1 (+ v_~f~0.offset_106 (* v_~x1~0_151 4)))) (= v_~x2~0_115 (select .cse1 (+ v_~f~0.offset_106 (* .cse0 4)))) (= (ite (and (< v_~x1~0_151 v_~size~0_118) (<= 0 v_~x1~0_151)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_116) (< v_~x2~0_116 v_~size~0_118)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_130| 1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_95|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) (* 2 (mod v_~n~0_117 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0))))) InVars {~x2~0=v_~x2~0_116, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_117, ~x1~0=v_~x1~0_151, ~f~0.offset=v_~f~0.offset_106} OutVars{~x2~0=v_~x2~0_115, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_82|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_95|, ~x1~0=v_~x1~0_150, ~f~0.offset=v_~f~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_36|, ~n~0=v_~n~0_117, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_36|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_90|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:11,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_155| v_~f~0.base_90))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_90 (* v_~x2~0_112 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_100| 1) (= (ite (and (<= 0 v_~x1~0_109) (< v_~x1~0_109 v_~size~0_102)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 2 (mod v_~n~0_101 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_102)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= (ite (and (<= 0 v_~x2~0_112) (< v_~x2~0_112 v_~size~0_102)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (select .cse1 (+ v_~f~0.offset_90 (* .cse0 4))) v_~x2~0_111) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|) (= (select .cse1 (+ v_~f~0.offset_90 (* v_~x1~0_109 4))) v_~x1~0_108)))) InVars {~x2~0=v_~x2~0_112, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_101, ~x1~0=v_~x1~0_109, ~f~0.offset=v_~f~0.offset_90} OutVars{~x2~0=v_~x2~0_111, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_56|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_44|, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~x1~0=v_~x1~0_108, ~f~0.offset=v_~f~0.offset_90, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_100|, #memory_int=|v_#memory_int_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_34|, ~n~0=v_~n~0_101, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_34|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_64|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:13,889 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 02:25:13,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4645 [2022-12-13 02:25:13,890 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-13 02:25:13,890 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-13 02:25:13,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:13,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:13,895 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-13 02:25:14,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:14,095 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-13 02:25:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1202382836, now seen corresponding path program 1 times [2022-12-13 02:25:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:14,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735441062] [2022-12-13 02:25:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:14,715 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-13 02:25:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735441062] [2022-12-13 02:25:14,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735441062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:14,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:14,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:14,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558638565] [2022-12-13 02:25:14,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:14,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:14,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:14,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:14,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 02:25:14,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 42 transitions, 276 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:14,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:14,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 02:25:14,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:14,822 INFO L130 PetriNetUnfolder]: 151/272 cut-off events. [2022-12-13 02:25:14,822 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-13 02:25:14,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 272 events. 151/272 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 885 event pairs, 42 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 634. Up to 237 conditions per place. [2022-12-13 02:25:14,824 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 38 selfloop transitions, 14 changer transitions 2/54 dead transitions. [2022-12-13 02:25:14,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 425 flow [2022-12-13 02:25:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-13 02:25:14,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2022-12-13 02:25:14,825 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 5 states and 46 transitions. [2022-12-13 02:25:14,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 425 flow [2022-12-13 02:25:14,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 349 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:14,827 INFO L231 Difference]: Finished difference. Result has 37 places, 43 transitions, 251 flow [2022-12-13 02:25:14,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=37, PETRI_TRANSITIONS=43} [2022-12-13 02:25:14,828 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 02:25:14,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:14,828 INFO L89 Accepts]: Start accepts. Operand has 37 places, 43 transitions, 251 flow [2022-12-13 02:25:14,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:14,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:14,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 43 transitions, 251 flow [2022-12-13 02:25:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 43 transitions, 251 flow [2022-12-13 02:25:14,838 INFO L130 PetriNetUnfolder]: 25/88 cut-off events. [2022-12-13 02:25:14,838 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-13 02:25:14,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 88 events. 25/88 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 185. Up to 30 conditions per place. [2022-12-13 02:25:14,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 43 transitions, 251 flow [2022-12-13 02:25:14,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 02:25:14,839 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:14,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 02:25:14,840 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 251 flow [2022-12-13 02:25:14,840 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-13 02:25:14,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:14,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:14,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 02:25:14,841 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-13 02:25:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1205008728, now seen corresponding path program 1 times [2022-12-13 02:25:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:14,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055814824] [2022-12-13 02:25:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:15,506 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-13 02:25:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:15,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055814824] [2022-12-13 02:25:15,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055814824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:15,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:15,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825829962] [2022-12-13 02:25:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:15,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:15,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:15,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:15,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 02:25:15,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 251 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-13 02:25:15,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:15,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 02:25:15,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:15,730 INFO L130 PetriNetUnfolder]: 222/392 cut-off events. [2022-12-13 02:25:15,731 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-12-13 02:25:15,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 392 events. 222/392 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1459 event pairs, 30 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 883. Up to 256 conditions per place. [2022-12-13 02:25:15,733 INFO L137 encePairwiseOnDemand]: 9/29 looper letters, 43 selfloop transitions, 32 changer transitions 1/76 dead transitions. [2022-12-13 02:25:15,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 566 flow [2022-12-13 02:25:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:25:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:25:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 02:25:15,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3505747126436782 [2022-12-13 02:25:15,734 INFO L175 Difference]: Start difference. First operand has 36 places, 43 transitions, 251 flow. Second operand 6 states and 61 transitions. [2022-12-13 02:25:15,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 566 flow [2022-12-13 02:25:15,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 76 transitions, 533 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:15,737 INFO L231 Difference]: Finished difference. Result has 41 places, 60 transitions, 468 flow [2022-12-13 02:25:15,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=41, PETRI_TRANSITIONS=60} [2022-12-13 02:25:15,737 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-13 02:25:15,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:15,737 INFO L89 Accepts]: Start accepts. Operand has 41 places, 60 transitions, 468 flow [2022-12-13 02:25:15,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:15,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:15,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 60 transitions, 468 flow [2022-12-13 02:25:15,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 60 transitions, 468 flow [2022-12-13 02:25:15,750 INFO L130 PetriNetUnfolder]: 37/122 cut-off events. [2022-12-13 02:25:15,750 INFO L131 PetriNetUnfolder]: For 124/131 co-relation queries the response was YES. [2022-12-13 02:25:15,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 122 events. 37/122 cut-off events. For 124/131 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 0 based on Foata normal form. 3/118 useless extension candidates. Maximal degree in co-relation 314. Up to 42 conditions per place. [2022-12-13 02:25:15,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 60 transitions, 468 flow [2022-12-13 02:25:15,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-13 02:25:18,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:18,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2688 [2022-12-13 02:25:18,426 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 60 transitions, 474 flow [2022-12-13 02:25:18,426 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-13 02:25:18,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:18,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:18,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 02:25:18,426 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-13 02:25:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -7334795, now seen corresponding path program 1 times [2022-12-13 02:25:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:18,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631426683] [2022-12-13 02:25:18,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:18,506 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-13 02:25:18,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631426683] [2022-12-13 02:25:18,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631426683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:18,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:18,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552915922] [2022-12-13 02:25:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:18,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:18,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:18,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:18,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:25:18,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 60 transitions, 474 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-13 02:25:18,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:18,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:25:18,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:18,618 INFO L130 PetriNetUnfolder]: 233/411 cut-off events. [2022-12-13 02:25:18,618 INFO L131 PetriNetUnfolder]: For 740/740 co-relation queries the response was YES. [2022-12-13 02:25:18,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 411 events. 233/411 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1534 event pairs, 96 based on Foata normal form. 8/399 useless extension candidates. Maximal degree in co-relation 1096. Up to 378 conditions per place. [2022-12-13 02:25:18,621 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 60 selfloop transitions, 6 changer transitions 1/67 dead transitions. [2022-12-13 02:25:18,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 643 flow [2022-12-13 02:25:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-13 02:25:18,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-13 02:25:18,622 INFO L175 Difference]: Start difference. First operand has 41 places, 60 transitions, 474 flow. Second operand 3 states and 39 transitions. [2022-12-13 02:25:18,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 643 flow [2022-12-13 02:25:18,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 637 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 02:25:18,625 INFO L231 Difference]: Finished difference. Result has 44 places, 60 transitions, 493 flow [2022-12-13 02:25:18,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=44, PETRI_TRANSITIONS=60} [2022-12-13 02:25:18,627 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 02:25:18,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:18,627 INFO L89 Accepts]: Start accepts. Operand has 44 places, 60 transitions, 493 flow [2022-12-13 02:25:18,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:18,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:18,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 60 transitions, 493 flow [2022-12-13 02:25:18,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 60 transitions, 493 flow [2022-12-13 02:25:18,645 INFO L130 PetriNetUnfolder]: 40/130 cut-off events. [2022-12-13 02:25:18,645 INFO L131 PetriNetUnfolder]: For 203/211 co-relation queries the response was YES. [2022-12-13 02:25:18,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 130 events. 40/130 cut-off events. For 203/211 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 548 event pairs, 0 based on Foata normal form. 3/129 useless extension candidates. Maximal degree in co-relation 368. Up to 48 conditions per place. [2022-12-13 02:25:18,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 60 transitions, 493 flow [2022-12-13 02:25:18,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-13 02:25:18,647 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:18,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 02:25:18,648 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 60 transitions, 493 flow [2022-12-13 02:25:18,648 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-13 02:25:18,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:18,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:18,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 02:25:18,648 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-13 02:25:18,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash 34369930, now seen corresponding path program 1 times [2022-12-13 02:25:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:18,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856799931] [2022-12-13 02:25:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:19,251 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-13 02:25:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:19,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856799931] [2022-12-13 02:25:19,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856799931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:19,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:19,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927569452] [2022-12-13 02:25:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:19,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:19,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:19,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 02:25:19,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 60 transitions, 493 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-13 02:25:19,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:19,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 02:25:19,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:19,477 INFO L130 PetriNetUnfolder]: 304/531 cut-off events. [2022-12-13 02:25:19,477 INFO L131 PetriNetUnfolder]: For 1170/1170 co-relation queries the response was YES. [2022-12-13 02:25:19,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 531 events. 304/531 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2139 event pairs, 34 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 1889. Up to 314 conditions per place. [2022-12-13 02:25:19,481 INFO L137 encePairwiseOnDemand]: 9/30 looper letters, 44 selfloop transitions, 48 changer transitions 1/93 dead transitions. [2022-12-13 02:25:19,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 93 transitions, 882 flow [2022-12-13 02:25:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:25:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:25:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-13 02:25:19,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-13 02:25:19,482 INFO L175 Difference]: Start difference. First operand has 43 places, 60 transitions, 493 flow. Second operand 6 states and 62 transitions. [2022-12-13 02:25:19,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 93 transitions, 882 flow [2022-12-13 02:25:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 863 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:19,492 INFO L231 Difference]: Finished difference. Result has 50 places, 77 transitions, 813 flow [2022-12-13 02:25:19,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=813, PETRI_PLACES=50, PETRI_TRANSITIONS=77} [2022-12-13 02:25:19,492 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-13 02:25:19,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:19,492 INFO L89 Accepts]: Start accepts. Operand has 50 places, 77 transitions, 813 flow [2022-12-13 02:25:19,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:19,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:19,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 77 transitions, 813 flow [2022-12-13 02:25:19,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 77 transitions, 813 flow [2022-12-13 02:25:19,513 INFO L130 PetriNetUnfolder]: 52/164 cut-off events. [2022-12-13 02:25:19,513 INFO L131 PetriNetUnfolder]: For 458/479 co-relation queries the response was YES. [2022-12-13 02:25:19,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 164 events. 52/164 cut-off events. For 458/479 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 766 event pairs, 0 based on Foata normal form. 7/163 useless extension candidates. Maximal degree in co-relation 554. Up to 60 conditions per place. [2022-12-13 02:25:19,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 77 transitions, 813 flow [2022-12-13 02:25:19,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 02:25:22,457 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:22,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2965 [2022-12-13 02:25:22,458 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 77 transitions, 825 flow [2022-12-13 02:25:22,458 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-13 02:25:22,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:22,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:22,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:25:22,458 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-13 02:25:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2062306086, now seen corresponding path program 1 times [2022-12-13 02:25:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:22,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74373117] [2022-12-13 02:25:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:22,537 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-13 02:25:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74373117] [2022-12-13 02:25:22,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74373117] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284369168] [2022-12-13 02:25:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:22,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:22,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:22,540 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-13 02:25:22,567 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-13 02:25:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:22,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:22,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:22,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:22,696 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-13 02:25:22,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284369168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:22,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:22,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-13 02:25:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972502614] [2022-12-13 02:25:22,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:22,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:25:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:25:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:25:22,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:25:22,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 77 transitions, 825 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-13 02:25:22,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:22,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:25:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:22,963 INFO L130 PetriNetUnfolder]: 391/683 cut-off events. [2022-12-13 02:25:22,963 INFO L131 PetriNetUnfolder]: For 2326/2326 co-relation queries the response was YES. [2022-12-13 02:25:22,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 683 events. 391/683 cut-off events. For 2326/2326 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2959 event pairs, 102 based on Foata normal form. 8/659 useless extension candidates. Maximal degree in co-relation 2207. Up to 324 conditions per place. [2022-12-13 02:25:22,968 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 76 selfloop transitions, 33 changer transitions 1/110 dead transitions. [2022-12-13 02:25:22,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 1258 flow [2022-12-13 02:25:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-13 02:25:22,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-13 02:25:22,969 INFO L175 Difference]: Start difference. First operand has 50 places, 77 transitions, 825 flow. Second operand 5 states and 65 transitions. [2022-12-13 02:25:22,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 1258 flow [2022-12-13 02:25:22,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 1232 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-12-13 02:25:22,980 INFO L231 Difference]: Finished difference. Result has 57 places, 82 transitions, 990 flow [2022-12-13 02:25:22,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=990, PETRI_PLACES=57, PETRI_TRANSITIONS=82} [2022-12-13 02:25:22,981 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2022-12-13 02:25:22,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:22,981 INFO L89 Accepts]: Start accepts. Operand has 57 places, 82 transitions, 990 flow [2022-12-13 02:25:22,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:22,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:22,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 82 transitions, 990 flow [2022-12-13 02:25:22,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 82 transitions, 990 flow [2022-12-13 02:25:23,005 INFO L130 PetriNetUnfolder]: 61/199 cut-off events. [2022-12-13 02:25:23,005 INFO L131 PetriNetUnfolder]: For 837/858 co-relation queries the response was YES. [2022-12-13 02:25:23,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 199 events. 61/199 cut-off events. For 837/858 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1035 event pairs, 1 based on Foata normal form. 9/199 useless extension candidates. Maximal degree in co-relation 760. Up to 74 conditions per place. [2022-12-13 02:25:23,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 82 transitions, 990 flow [2022-12-13 02:25:23,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-13 02:25:23,024 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:23,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 02:25:23,025 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 82 transitions, 990 flow [2022-12-13 02:25:23,025 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-13 02:25:23,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:23,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:23,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:23,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 02:25:23,231 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-13 02:25:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash 853038601, now seen corresponding path program 1 times [2022-12-13 02:25:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:23,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22007436] [2022-12-13 02:25:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:23,925 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-13 02:25:23,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:23,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22007436] [2022-12-13 02:25:23,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22007436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:23,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:23,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52735785] [2022-12-13 02:25:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:23,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:23,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:23,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:25:23,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 82 transitions, 990 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-13 02:25:23,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:23,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:25:23,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:24,210 INFO L130 PetriNetUnfolder]: 478/833 cut-off events. [2022-12-13 02:25:24,210 INFO L131 PetriNetUnfolder]: For 4057/4057 co-relation queries the response was YES. [2022-12-13 02:25:24,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 833 events. 478/833 cut-off events. For 4057/4057 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3836 event pairs, 86 based on Foata normal form. 1/794 useless extension candidates. Maximal degree in co-relation 3229. Up to 535 conditions per place. [2022-12-13 02:25:24,217 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 50 selfloop transitions, 64 changer transitions 1/115 dead transitions. [2022-12-13 02:25:24,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 1482 flow [2022-12-13 02:25:24,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:25:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:25:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-13 02:25:24,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2022-12-13 02:25:24,219 INFO L175 Difference]: Start difference. First operand has 57 places, 82 transitions, 990 flow. Second operand 6 states and 63 transitions. [2022-12-13 02:25:24,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 1482 flow [2022-12-13 02:25:24,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 1446 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:24,251 INFO L231 Difference]: Finished difference. Result has 64 places, 99 transitions, 1403 flow [2022-12-13 02:25:24,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1403, PETRI_PLACES=64, PETRI_TRANSITIONS=99} [2022-12-13 02:25:24,253 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 43 predicate places. [2022-12-13 02:25:24,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:24,253 INFO L89 Accepts]: Start accepts. Operand has 64 places, 99 transitions, 1403 flow [2022-12-13 02:25:24,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:24,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:24,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 99 transitions, 1403 flow [2022-12-13 02:25:24,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 99 transitions, 1403 flow [2022-12-13 02:25:24,289 INFO L130 PetriNetUnfolder]: 74/239 cut-off events. [2022-12-13 02:25:24,289 INFO L131 PetriNetUnfolder]: For 1286/1322 co-relation queries the response was YES. [2022-12-13 02:25:24,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 239 events. 74/239 cut-off events. For 1286/1322 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1312 event pairs, 1 based on Foata normal form. 13/240 useless extension candidates. Maximal degree in co-relation 1062. Up to 88 conditions per place. [2022-12-13 02:25:24,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 99 transitions, 1403 flow [2022-12-13 02:25:24,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 02:25:24,295 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:24,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 02:25:24,296 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 99 transitions, 1403 flow [2022-12-13 02:25:24,296 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-13 02:25:24,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:24,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:24,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 02:25:24,298 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-13 02:25:24,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1174894548, now seen corresponding path program 1 times [2022-12-13 02:25:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:24,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838959668] [2022-12-13 02:25:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:25,039 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-13 02:25:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:25,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838959668] [2022-12-13 02:25:25,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838959668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:25,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:25,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740052253] [2022-12-13 02:25:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:25,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:25,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:25,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:25:25,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 99 transitions, 1403 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-13 02:25:25,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:25,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:25:25,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:25,259 INFO L130 PetriNetUnfolder]: 504/880 cut-off events. [2022-12-13 02:25:25,259 INFO L131 PetriNetUnfolder]: For 5507/5507 co-relation queries the response was YES. [2022-12-13 02:25:25,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 880 events. 504/880 cut-off events. For 5507/5507 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4094 event pairs, 103 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 3698. Up to 616 conditions per place. [2022-12-13 02:25:25,267 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 64 selfloop transitions, 54 changer transitions 1/119 dead transitions. [2022-12-13 02:25:25,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 1752 flow [2022-12-13 02:25:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-13 02:25:25,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2022-12-13 02:25:25,268 INFO L175 Difference]: Start difference. First operand has 64 places, 99 transitions, 1403 flow. Second operand 5 states and 61 transitions. [2022-12-13 02:25:25,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 1752 flow [2022-12-13 02:25:25,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1738 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 02:25:25,285 INFO L231 Difference]: Finished difference. Result has 70 places, 103 transitions, 1614 flow [2022-12-13 02:25:25,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1614, PETRI_PLACES=70, PETRI_TRANSITIONS=103} [2022-12-13 02:25:25,286 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 02:25:25,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:25,286 INFO L89 Accepts]: Start accepts. Operand has 70 places, 103 transitions, 1614 flow [2022-12-13 02:25:25,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:25,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:25,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 103 transitions, 1614 flow [2022-12-13 02:25:25,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 103 transitions, 1614 flow [2022-12-13 02:25:25,317 INFO L130 PetriNetUnfolder]: 76/250 cut-off events. [2022-12-13 02:25:25,317 INFO L131 PetriNetUnfolder]: For 1795/1829 co-relation queries the response was YES. [2022-12-13 02:25:25,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 250 events. 76/250 cut-off events. For 1795/1829 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1404 event pairs, 1 based on Foata normal form. 14/251 useless extension candidates. Maximal degree in co-relation 1188. Up to 92 conditions per place. [2022-12-13 02:25:25,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 103 transitions, 1614 flow [2022-12-13 02:25:25,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 02:25:25,321 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:25,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 02:25:25,323 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 103 transitions, 1614 flow [2022-12-13 02:25:25,323 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-13 02:25:25,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:25,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:25,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 02:25:25,323 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-13 02:25:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash -438977307, now seen corresponding path program 1 times [2022-12-13 02:25:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:25,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870271757] [2022-12-13 02:25:25,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:25,404 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-13 02:25:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870271757] [2022-12-13 02:25:25,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870271757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:25,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:25,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:25:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712949397] [2022-12-13 02:25:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:25,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:25,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:25:25,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 103 transitions, 1614 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-13 02:25:25,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:25,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:25:25,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:25,657 INFO L130 PetriNetUnfolder]: 522/980 cut-off events. [2022-12-13 02:25:25,657 INFO L131 PetriNetUnfolder]: For 7884/7884 co-relation queries the response was YES. [2022-12-13 02:25:25,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 980 events. 522/980 cut-off events. For 7884/7884 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5170 event pairs, 68 based on Foata normal form. 36/976 useless extension candidates. Maximal degree in co-relation 4147. Up to 427 conditions per place. [2022-12-13 02:25:25,670 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 97 selfloop transitions, 39 changer transitions 12/148 dead transitions. [2022-12-13 02:25:25,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 148 transitions, 2380 flow [2022-12-13 02:25:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-13 02:25:25,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2022-12-13 02:25:25,672 INFO L175 Difference]: Start difference. First operand has 70 places, 103 transitions, 1614 flow. Second operand 5 states and 58 transitions. [2022-12-13 02:25:25,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 148 transitions, 2380 flow [2022-12-13 02:25:25,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 148 transitions, 2353 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:25,693 INFO L231 Difference]: Finished difference. Result has 76 places, 105 transitions, 1764 flow [2022-12-13 02:25:25,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1764, PETRI_PLACES=76, PETRI_TRANSITIONS=105} [2022-12-13 02:25:25,693 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2022-12-13 02:25:25,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:25,693 INFO L89 Accepts]: Start accepts. Operand has 76 places, 105 transitions, 1764 flow [2022-12-13 02:25:25,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:25,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:25,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 105 transitions, 1764 flow [2022-12-13 02:25:25,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 105 transitions, 1764 flow [2022-12-13 02:25:25,729 INFO L130 PetriNetUnfolder]: 76/277 cut-off events. [2022-12-13 02:25:25,730 INFO L131 PetriNetUnfolder]: For 2300/2327 co-relation queries the response was YES. [2022-12-13 02:25:25,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 277 events. 76/277 cut-off events. For 2300/2327 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1662 event pairs, 1 based on Foata normal form. 14/279 useless extension candidates. Maximal degree in co-relation 1391. Up to 93 conditions per place. [2022-12-13 02:25:25,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 105 transitions, 1764 flow [2022-12-13 02:25:25,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-13 02:25:25,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:25,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:25,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-13 02:25:25,958 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 105 transitions, 1779 flow [2022-12-13 02:25:25,958 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-13 02:25:25,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:25,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:25,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 02:25:25,958 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-13 02:25:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash 919242395, now seen corresponding path program 2 times [2022-12-13 02:25:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082732328] [2022-12-13 02:25:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:26,037 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-13 02:25:26,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:26,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082732328] [2022-12-13 02:25:26,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082732328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:26,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637281257] [2022-12-13 02:25:26,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:25:26,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:26,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:26,039 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-13 02:25:26,041 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-13 02:25:26,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:25:26,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:25:26,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:26,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:26,187 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-13 02:25:26,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:26,228 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-13 02:25:26,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637281257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:26,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:26,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 02:25:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119294766] [2022-12-13 02:25:26,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:26,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:25:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:25:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:25:26,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:25:26,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 105 transitions, 1779 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:26,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:26,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:25:26,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:26,637 INFO L130 PetriNetUnfolder]: 548/1003 cut-off events. [2022-12-13 02:25:26,637 INFO L131 PetriNetUnfolder]: For 9704/9704 co-relation queries the response was YES. [2022-12-13 02:25:26,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 1003 events. 548/1003 cut-off events. For 9704/9704 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5073 event pairs, 118 based on Foata normal form. 31/994 useless extension candidates. Maximal degree in co-relation 5051. Up to 361 conditions per place. [2022-12-13 02:25:26,647 INFO L137 encePairwiseOnDemand]: 14/32 looper letters, 81 selfloop transitions, 83 changer transitions 0/164 dead transitions. [2022-12-13 02:25:26,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 164 transitions, 2594 flow [2022-12-13 02:25:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:25:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:25:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2022-12-13 02:25:26,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.296875 [2022-12-13 02:25:26,649 INFO L175 Difference]: Start difference. First operand has 76 places, 105 transitions, 1779 flow. Second operand 10 states and 95 transitions. [2022-12-13 02:25:26,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 164 transitions, 2594 flow [2022-12-13 02:25:26,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 164 transitions, 2350 flow, removed 81 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:26,677 INFO L231 Difference]: Finished difference. Result has 91 places, 125 transitions, 2140 flow [2022-12-13 02:25:26,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2140, PETRI_PLACES=91, PETRI_TRANSITIONS=125} [2022-12-13 02:25:26,678 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-13 02:25:26,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:26,678 INFO L89 Accepts]: Start accepts. Operand has 91 places, 125 transitions, 2140 flow [2022-12-13 02:25:26,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:26,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:26,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 125 transitions, 2140 flow [2022-12-13 02:25:26,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 125 transitions, 2140 flow [2022-12-13 02:25:26,728 INFO L130 PetriNetUnfolder]: 119/367 cut-off events. [2022-12-13 02:25:26,728 INFO L131 PetriNetUnfolder]: For 4324/4392 co-relation queries the response was YES. [2022-12-13 02:25:26,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 367 events. 119/367 cut-off events. For 4324/4392 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2237 event pairs, 8 based on Foata normal form. 42/396 useless extension candidates. Maximal degree in co-relation 2110. Up to 142 conditions per place. [2022-12-13 02:25:26,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 125 transitions, 2140 flow [2022-12-13 02:25:26,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 02:25:26,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:27,034 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:25:27,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-13 02:25:27,035 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 124 transitions, 2140 flow [2022-12-13 02:25:27,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:27,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,046 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-13 02:25:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:27,236 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-13 02:25:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -137610093, now seen corresponding path program 3 times [2022-12-13 02:25:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297728360] [2022-12-13 02:25:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:27,317 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-13 02:25:27,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:27,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297728360] [2022-12-13 02:25:27,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297728360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:27,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:27,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:25:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954249419] [2022-12-13 02:25:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:27,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:27,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:27,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:25:27,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 124 transitions, 2140 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-13 02:25:27,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:27,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:25:27,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:27,586 INFO L130 PetriNetUnfolder]: 470/921 cut-off events. [2022-12-13 02:25:27,587 INFO L131 PetriNetUnfolder]: For 12869/12869 co-relation queries the response was YES. [2022-12-13 02:25:27,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6142 conditions, 921 events. 470/921 cut-off events. For 12869/12869 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4901 event pairs, 134 based on Foata normal form. 76/989 useless extension candidates. Maximal degree in co-relation 5288. Up to 458 conditions per place. [2022-12-13 02:25:27,596 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 81 selfloop transitions, 63 changer transitions 0/144 dead transitions. [2022-12-13 02:25:27,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 144 transitions, 2554 flow [2022-12-13 02:25:27,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 02:25:27,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2022-12-13 02:25:27,597 INFO L175 Difference]: Start difference. First operand has 90 places, 124 transitions, 2140 flow. Second operand 5 states and 66 transitions. [2022-12-13 02:25:27,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 144 transitions, 2554 flow [2022-12-13 02:25:27,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 144 transitions, 2464 flow, removed 45 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:27,631 INFO L231 Difference]: Finished difference. Result has 94 places, 126 transitions, 2242 flow [2022-12-13 02:25:27,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2242, PETRI_PLACES=94, PETRI_TRANSITIONS=126} [2022-12-13 02:25:27,632 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-13 02:25:27,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:27,632 INFO L89 Accepts]: Start accepts. Operand has 94 places, 126 transitions, 2242 flow [2022-12-13 02:25:27,633 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:27,633 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:27,633 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 126 transitions, 2242 flow [2022-12-13 02:25:27,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 126 transitions, 2242 flow [2022-12-13 02:25:27,696 INFO L130 PetriNetUnfolder]: 116/381 cut-off events. [2022-12-13 02:25:27,696 INFO L131 PetriNetUnfolder]: For 4555/4600 co-relation queries the response was YES. [2022-12-13 02:25:27,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 381 events. 116/381 cut-off events. For 4555/4600 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2435 event pairs, 10 based on Foata normal form. 22/391 useless extension candidates. Maximal degree in co-relation 2173. Up to 124 conditions per place. [2022-12-13 02:25:27,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 126 transitions, 2242 flow [2022-12-13 02:25:27,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 02:25:27,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:27,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:28,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:28,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:28,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:28,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:28,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:28,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:29,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:29,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:29,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:29,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:29,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:29,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:29,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:30,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:30,241 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:30,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:30,557 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:25:30,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2926 [2022-12-13 02:25:30,558 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 128 transitions, 2377 flow [2022-12-13 02:25:30,558 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-13 02:25:30,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:30,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:30,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 02:25:30,559 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-13 02:25:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1990663069, now seen corresponding path program 1 times [2022-12-13 02:25:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:30,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065692729] [2022-12-13 02:25:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:31,302 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-13 02:25:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065692729] [2022-12-13 02:25:31,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065692729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:31,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:31,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109380931] [2022-12-13 02:25:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:31,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:31,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 02:25:31,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 128 transitions, 2377 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-13 02:25:31,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:31,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 02:25:31,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:31,693 INFO L130 PetriNetUnfolder]: 533/1093 cut-off events. [2022-12-13 02:25:31,694 INFO L131 PetriNetUnfolder]: For 12958/12958 co-relation queries the response was YES. [2022-12-13 02:25:31,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7514 conditions, 1093 events. 533/1093 cut-off events. For 12958/12958 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6457 event pairs, 203 based on Foata normal form. 1/1078 useless extension candidates. Maximal degree in co-relation 6511. Up to 954 conditions per place. [2022-12-13 02:25:31,706 INFO L137 encePairwiseOnDemand]: 27/52 looper letters, 109 selfloop transitions, 45 changer transitions 3/157 dead transitions. [2022-12-13 02:25:31,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 157 transitions, 3055 flow [2022-12-13 02:25:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:25:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:25:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 02:25:31,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25961538461538464 [2022-12-13 02:25:31,708 INFO L175 Difference]: Start difference. First operand has 96 places, 128 transitions, 2377 flow. Second operand 6 states and 81 transitions. [2022-12-13 02:25:31,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 157 transitions, 3055 flow [2022-12-13 02:25:31,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 157 transitions, 2819 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-13 02:25:31,746 INFO L231 Difference]: Finished difference. Result has 100 places, 140 transitions, 2544 flow [2022-12-13 02:25:31,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2544, PETRI_PLACES=100, PETRI_TRANSITIONS=140} [2022-12-13 02:25:31,747 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-13 02:25:31,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:31,748 INFO L89 Accepts]: Start accepts. Operand has 100 places, 140 transitions, 2544 flow [2022-12-13 02:25:31,749 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:31,749 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:31,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 140 transitions, 2544 flow [2022-12-13 02:25:31,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 140 transitions, 2544 flow [2022-12-13 02:25:31,806 INFO L130 PetriNetUnfolder]: 121/459 cut-off events. [2022-12-13 02:25:31,807 INFO L131 PetriNetUnfolder]: For 4975/5022 co-relation queries the response was YES. [2022-12-13 02:25:31,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 459 events. 121/459 cut-off events. For 4975/5022 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3305 event pairs, 13 based on Foata normal form. 25/465 useless extension candidates. Maximal degree in co-relation 2717. Up to 139 conditions per place. [2022-12-13 02:25:31,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 140 transitions, 2544 flow [2022-12-13 02:25:31,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 02:25:33,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:33,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1800 [2022-12-13 02:25:33,548 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 140 transitions, 2556 flow [2022-12-13 02:25:33,548 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-13 02:25:33,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:33,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:33,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 02:25:33,548 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-13 02:25:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1213637383, now seen corresponding path program 1 times [2022-12-13 02:25:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171064135] [2022-12-13 02:25:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:33,640 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-13 02:25:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:33,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171064135] [2022-12-13 02:25:33,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171064135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:33,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:33,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143952603] [2022-12-13 02:25:33,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:33,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:33,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 02:25:33,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 140 transitions, 2556 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:33,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:33,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 02:25:33,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:33,980 INFO L130 PetriNetUnfolder]: 536/1098 cut-off events. [2022-12-13 02:25:33,980 INFO L131 PetriNetUnfolder]: For 12711/12711 co-relation queries the response was YES. [2022-12-13 02:25:33,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 1098 events. 536/1098 cut-off events. For 12711/12711 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6500 event pairs, 256 based on Foata normal form. 2/1070 useless extension candidates. Maximal degree in co-relation 7327. Up to 1038 conditions per place. [2022-12-13 02:25:33,992 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 130 selfloop transitions, 15 changer transitions 7/152 dead transitions. [2022-12-13 02:25:33,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 152 transitions, 2962 flow [2022-12-13 02:25:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 02:25:33,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-13 02:25:33,994 INFO L175 Difference]: Start difference. First operand has 100 places, 140 transitions, 2556 flow. Second operand 4 states and 68 transitions. [2022-12-13 02:25:33,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 152 transitions, 2962 flow [2022-12-13 02:25:34,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 152 transitions, 2878 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 02:25:34,033 INFO L231 Difference]: Finished difference. Result has 100 places, 143 transitions, 2582 flow [2022-12-13 02:25:34,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2472, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2582, PETRI_PLACES=100, PETRI_TRANSITIONS=143} [2022-12-13 02:25:34,033 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-13 02:25:34,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:34,033 INFO L89 Accepts]: Start accepts. Operand has 100 places, 143 transitions, 2582 flow [2022-12-13 02:25:34,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:34,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:34,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 143 transitions, 2582 flow [2022-12-13 02:25:34,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 143 transitions, 2582 flow [2022-12-13 02:25:34,095 INFO L130 PetriNetUnfolder]: 122/459 cut-off events. [2022-12-13 02:25:34,096 INFO L131 PetriNetUnfolder]: For 5120/5169 co-relation queries the response was YES. [2022-12-13 02:25:34,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 459 events. 122/459 cut-off events. For 5120/5169 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3312 event pairs, 14 based on Foata normal form. 27/465 useless extension candidates. Maximal degree in co-relation 2469. Up to 139 conditions per place. [2022-12-13 02:25:34,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 143 transitions, 2582 flow [2022-12-13 02:25:34,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-13 02:25:34,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:34,590 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:34,590 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 557 [2022-12-13 02:25:34,591 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 142 transitions, 2593 flow [2022-12-13 02:25:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:34,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:34,591 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 02:25:34,591 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-13 02:25:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash -4697782, now seen corresponding path program 1 times [2022-12-13 02:25:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:34,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428876595] [2022-12-13 02:25:34,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:34,684 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-13 02:25:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:34,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428876595] [2022-12-13 02:25:34,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428876595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:34,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008059137] [2022-12-13 02:25:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:34,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:34,688 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-13 02:25:34,690 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-13 02:25:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:34,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:34,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:34,815 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-13 02:25:34,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:34,846 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-13 02:25:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008059137] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:34,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:34,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-12-13 02:25:34,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529538485] [2022-12-13 02:25:34,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:25:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:34,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:25:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:25:34,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 02:25:34,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 142 transitions, 2593 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-13 02:25:34,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:34,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 02:25:34,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:35,390 INFO L130 PetriNetUnfolder]: 571/1189 cut-off events. [2022-12-13 02:25:35,391 INFO L131 PetriNetUnfolder]: For 14258/14258 co-relation queries the response was YES. [2022-12-13 02:25:35,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8033 conditions, 1189 events. 571/1189 cut-off events. For 14258/14258 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7244 event pairs, 252 based on Foata normal form. 34/1193 useless extension candidates. Maximal degree in co-relation 6984. Up to 1025 conditions per place. [2022-12-13 02:25:35,418 INFO L137 encePairwiseOnDemand]: 39/54 looper letters, 144 selfloop transitions, 21 changer transitions 9/174 dead transitions. [2022-12-13 02:25:35,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 174 transitions, 3197 flow [2022-12-13 02:25:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:25:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:25:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-13 02:25:35,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2839506172839506 [2022-12-13 02:25:35,420 INFO L175 Difference]: Start difference. First operand has 99 places, 142 transitions, 2593 flow. Second operand 6 states and 92 transitions. [2022-12-13 02:25:35,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 174 transitions, 3197 flow [2022-12-13 02:25:35,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 174 transitions, 3149 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:35,494 INFO L231 Difference]: Finished difference. Result has 104 places, 145 transitions, 2648 flow [2022-12-13 02:25:35,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2551, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2648, PETRI_PLACES=104, PETRI_TRANSITIONS=145} [2022-12-13 02:25:35,495 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 83 predicate places. [2022-12-13 02:25:35,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:35,495 INFO L89 Accepts]: Start accepts. Operand has 104 places, 145 transitions, 2648 flow [2022-12-13 02:25:35,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:35,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:35,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 145 transitions, 2648 flow [2022-12-13 02:25:35,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 145 transitions, 2648 flow [2022-12-13 02:25:35,556 INFO L130 PetriNetUnfolder]: 128/500 cut-off events. [2022-12-13 02:25:35,556 INFO L131 PetriNetUnfolder]: For 5895/5946 co-relation queries the response was YES. [2022-12-13 02:25:35,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 500 events. 128/500 cut-off events. For 5895/5946 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3737 event pairs, 14 based on Foata normal form. 27/505 useless extension candidates. Maximal degree in co-relation 2699. Up to 151 conditions per place. [2022-12-13 02:25:35,563 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 145 transitions, 2648 flow [2022-12-13 02:25:35,563 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 02:25:35,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:35,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 480 [2022-12-13 02:25:35,975 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 145 transitions, 2663 flow [2022-12-13 02:25:35,975 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-13 02:25:35,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:35,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:35,983 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-13 02:25:36,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:36,177 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-13 02:25:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1538220514, now seen corresponding path program 1 times [2022-12-13 02:25:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:36,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852249117] [2022-12-13 02:25:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,601 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-13 02:25:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852249117] [2022-12-13 02:25:36,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852249117] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288442542] [2022-12-13 02:25:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:36,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:36,604 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-13 02:25:36,612 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-13 02:25:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:25:36,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:36,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:36,753 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-13 02:25:36,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:36,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 02:25:36,825 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-13 02:25:36,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:36,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:36,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 02:25:36,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:36,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-13 02:25:37,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-13 02:25:37,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288442542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:37,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:37,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:25:37,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706577760] [2022-12-13 02:25:37,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:37,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:25:37,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:37,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:25:37,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:25:37,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 02:25:37,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 145 transitions, 2663 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-13 02:25:37,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:37,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 02:25:37,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:37,847 INFO L130 PetriNetUnfolder]: 791/1600 cut-off events. [2022-12-13 02:25:37,847 INFO L131 PetriNetUnfolder]: For 22846/22846 co-relation queries the response was YES. [2022-12-13 02:25:37,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 1600 events. 791/1600 cut-off events. For 22846/22846 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9976 event pairs, 152 based on Foata normal form. 3/1575 useless extension candidates. Maximal degree in co-relation 9941. Up to 707 conditions per place. [2022-12-13 02:25:37,864 INFO L137 encePairwiseOnDemand]: 18/55 looper letters, 101 selfloop transitions, 110 changer transitions 14/225 dead transitions. [2022-12-13 02:25:37,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 225 transitions, 3881 flow [2022-12-13 02:25:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:25:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:25:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2022-12-13 02:25:37,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2231404958677686 [2022-12-13 02:25:37,867 INFO L175 Difference]: Start difference. First operand has 104 places, 145 transitions, 2663 flow. Second operand 11 states and 135 transitions. [2022-12-13 02:25:37,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 225 transitions, 3881 flow [2022-12-13 02:25:37,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 225 transitions, 3755 flow, removed 55 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:37,924 INFO L231 Difference]: Finished difference. Result has 117 places, 170 transitions, 3295 flow [2022-12-13 02:25:37,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3295, PETRI_PLACES=117, PETRI_TRANSITIONS=170} [2022-12-13 02:25:37,924 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2022-12-13 02:25:37,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:37,924 INFO L89 Accepts]: Start accepts. Operand has 117 places, 170 transitions, 3295 flow [2022-12-13 02:25:37,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:37,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:37,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 170 transitions, 3295 flow [2022-12-13 02:25:37,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 170 transitions, 3295 flow [2022-12-13 02:25:38,032 INFO L130 PetriNetUnfolder]: 174/653 cut-off events. [2022-12-13 02:25:38,032 INFO L131 PetriNetUnfolder]: For 8848/8930 co-relation queries the response was YES. [2022-12-13 02:25:38,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 653 events. 174/653 cut-off events. For 8848/8930 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5086 event pairs, 27 based on Foata normal form. 31/656 useless extension candidates. Maximal degree in co-relation 3844. Up to 207 conditions per place. [2022-12-13 02:25:38,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 170 transitions, 3295 flow [2022-12-13 02:25:38,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 02:25:38,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_106| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (= (ite (and (<= 0 v_~x1~0_119) (< v_~x1~0_119 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_52| |v_#pthreadsForks_64|) (= (store |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_52|)) |v_#memory_int_159|) (= v_~x1~0_118 (select (select |v_#memory_int_160| v_~f~0.base_94) (+ v_~f~0.offset_94 (* v_~x1~0_119 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_106| 4294967295) 4294967296) (* 2 (mod v_~n~0_105 2147483648))) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|)) InVars {#pthreadsForks=|v_#pthreadsForks_64|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, #memory_int=|v_#memory_int_160|, ~n~0=v_~n~0_105, ~x1~0=v_~x1~0_119, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ~f~0.offset=v_~f~0.offset_94} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, ~x1~0=v_~x1~0_118, ~f~0.offset=v_~f~0.offset_94, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_52|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_41|, #pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_55|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_159|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, ~n~0=v_~n~0_105, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:38,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:38,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-13 02:25:38,221 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 170 transitions, 3313 flow [2022-12-13 02:25:38,221 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-13 02:25:38,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:38,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:38,232 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-13 02:25:38,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:38,422 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-13 02:25:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1099146626, now seen corresponding path program 1 times [2022-12-13 02:25:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:38,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688432232] [2022-12-13 02:25:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:38,604 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-13 02:25:38,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:38,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688432232] [2022-12-13 02:25:38,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688432232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:38,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828657482] [2022-12-13 02:25:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:38,608 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-13 02:25:38,610 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-13 02:25:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:38,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 02:25:38,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:38,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:38,742 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-13 02:25:38,745 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-13 02:25:38,767 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-13 02:25:38,901 INFO L321 Elim1Store]: treesize reduction 87, result has 28.1 percent of original size [2022-12-13 02:25:38,902 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 253 treesize of output 95 [2022-12-13 02:25:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:38,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:39,287 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-13 02:25:39,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828657482] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:39,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:39,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-13 02:25:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453118087] [2022-12-13 02:25:39,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:39,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:25:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:39,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:25:39,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=115, Unknown=2, NotChecked=0, Total=156 [2022-12-13 02:25:39,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 02:25:39,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 170 transitions, 3313 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:39,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:39,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 02:25:39,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:55,771 WARN L233 SmtUtils]: Spent 16.27s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:25:57,486 INFO L130 PetriNetUnfolder]: 892/1794 cut-off events. [2022-12-13 02:25:57,486 INFO L131 PetriNetUnfolder]: For 27088/27088 co-relation queries the response was YES. [2022-12-13 02:25:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13181 conditions, 1794 events. 892/1794 cut-off events. For 27088/27088 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11562 event pairs, 254 based on Foata normal form. 8/1780 useless extension candidates. Maximal degree in co-relation 11704. Up to 1406 conditions per place. [2022-12-13 02:25:57,503 INFO L137 encePairwiseOnDemand]: 24/56 looper letters, 144 selfloop transitions, 66 changer transitions 30/240 dead transitions. [2022-12-13 02:25:57,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 240 transitions, 4452 flow [2022-12-13 02:25:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:25:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:25:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2022-12-13 02:25:57,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19345238095238096 [2022-12-13 02:25:57,504 INFO L175 Difference]: Start difference. First operand has 117 places, 170 transitions, 3313 flow. Second operand 12 states and 130 transitions. [2022-12-13 02:25:57,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 240 transitions, 4452 flow [2022-12-13 02:25:57,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 240 transitions, 4372 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:57,579 INFO L231 Difference]: Finished difference. Result has 131 places, 183 transitions, 3674 flow [2022-12-13 02:25:57,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3235, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3674, PETRI_PLACES=131, PETRI_TRANSITIONS=183} [2022-12-13 02:25:57,579 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 110 predicate places. [2022-12-13 02:25:57,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:57,579 INFO L89 Accepts]: Start accepts. Operand has 131 places, 183 transitions, 3674 flow [2022-12-13 02:25:57,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:57,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:57,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 183 transitions, 3674 flow [2022-12-13 02:25:57,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 183 transitions, 3674 flow [2022-12-13 02:25:57,648 INFO L130 PetriNetUnfolder]: 190/719 cut-off events. [2022-12-13 02:25:57,648 INFO L131 PetriNetUnfolder]: For 10487/10579 co-relation queries the response was YES. [2022-12-13 02:25:57,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 719 events. 190/719 cut-off events. For 10487/10579 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5812 event pairs, 29 based on Foata normal form. 27/720 useless extension candidates. Maximal degree in co-relation 4715. Up to 219 conditions per place. [2022-12-13 02:25:57,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 183 transitions, 3674 flow [2022-12-13 02:25:57,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 02:25:57,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_279| v_~f~0.base_186))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_186 (* v_~x2~0_233 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_186 (* .cse5 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_186 (* .cse4 4)))) (.cse2 (* (mod v_~n~0_189 2147483648) 2)) (.cse3 (select .cse0 (+ v_~f~0.offset_186 (* v_~x1~0_290 4))))) (and (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_186)) v_~x2~0_231) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_243| 4294967295) 4294967296) .cse2) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_191|) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_190)) 1 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_244| 4294967296) .cse2) (not (= (ite (and (< v_~x1~0_290 v_~size~0_190) (<= 0 v_~x1~0_290)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|) (= |v_thread1Thread1of1ForFork0_~i~0#1_243| (+ |v_thread1Thread1of1ForFork0_~i~0#1_244| 2)) (= (ite (and (< .cse3 v_~size~0_190) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_193| 4) |v_thread2Thread1of1ForFork1_~i~1#1_191|) (not (= (ite (and (< v_~x2~0_233 v_~size~0_190) (<= 0 v_~x2~0_233)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_193| 4294967296) .cse2) (not (= (ite (and (< .cse4 v_~size~0_190) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (= (select .cse0 (+ v_~f~0.offset_186 (* .cse3 4))) v_~x1~0_289) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_190)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_244|, #memory_int=|v_#memory_int_279|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_193|, ~n~0=v_~n~0_189, ~x1~0=v_~x1~0_290, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_231, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_153|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_102|, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_106|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~x1~0=v_~x1~0_289, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_243|, #memory_int=|v_#memory_int_279|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_92|, ~n~0=v_~n~0_189, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_92|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_161|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:25:59,468 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:59,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1890 [2022-12-13 02:25:59,469 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 183 transitions, 3712 flow [2022-12-13 02:25:59,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:59,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:59,469 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:59,479 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-13 02:25:59,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 02:25:59,675 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-13 02:25:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1649824770, now seen corresponding path program 1 times [2022-12-13 02:25:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:59,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110029899] [2022-12-13 02:25:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,755 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-13 02:25:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110029899] [2022-12-13 02:25:59,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110029899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740688259] [2022-12-13 02:25:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:59,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:59,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:59,757 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-13 02:25:59,758 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-13 02:25:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:59,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:59,913 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-13 02:25:59,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:59,943 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-13 02:25:59,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740688259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:59,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:59,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 02:25:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338318335] [2022-12-13 02:25:59,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:25:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:25:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:25:59,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 02:25:59,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 183 transitions, 3712 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:59,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 02:25:59,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:00,617 INFO L130 PetriNetUnfolder]: 1002/1993 cut-off events. [2022-12-13 02:26:00,617 INFO L131 PetriNetUnfolder]: For 32359/32359 co-relation queries the response was YES. [2022-12-13 02:26:00,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15372 conditions, 1993 events. 1002/1993 cut-off events. For 32359/32359 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13051 event pairs, 268 based on Foata normal form. 6/1989 useless extension candidates. Maximal degree in co-relation 14994. Up to 1024 conditions per place. [2022-12-13 02:26:00,631 INFO L137 encePairwiseOnDemand]: 19/58 looper letters, 143 selfloop transitions, 88 changer transitions 1/232 dead transitions. [2022-12-13 02:26:00,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 232 transitions, 4867 flow [2022-12-13 02:26:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:26:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:26:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 02:26:00,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28448275862068967 [2022-12-13 02:26:00,633 INFO L175 Difference]: Start difference. First operand has 130 places, 183 transitions, 3712 flow. Second operand 6 states and 99 transitions. [2022-12-13 02:26:00,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 232 transitions, 4867 flow [2022-12-13 02:26:00,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 232 transitions, 4727 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-13 02:26:00,738 INFO L231 Difference]: Finished difference. Result has 133 places, 187 transitions, 3989 flow [2022-12-13 02:26:00,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3989, PETRI_PLACES=133, PETRI_TRANSITIONS=187} [2022-12-13 02:26:00,739 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-13 02:26:00,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:00,739 INFO L89 Accepts]: Start accepts. Operand has 133 places, 187 transitions, 3989 flow [2022-12-13 02:26:00,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:00,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:00,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 187 transitions, 3989 flow [2022-12-13 02:26:00,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 187 transitions, 3989 flow [2022-12-13 02:26:00,825 INFO L130 PetriNetUnfolder]: 210/780 cut-off events. [2022-12-13 02:26:00,825 INFO L131 PetriNetUnfolder]: For 12603/12730 co-relation queries the response was YES. [2022-12-13 02:26:00,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5540 conditions, 780 events. 210/780 cut-off events. For 12603/12730 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6410 event pairs, 39 based on Foata normal form. 37/783 useless extension candidates. Maximal degree in co-relation 5370. Up to 235 conditions per place. [2022-12-13 02:26:00,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 187 transitions, 3989 flow [2022-12-13 02:26:00,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 02:26:00,833 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:00,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:00,834 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 187 transitions, 3989 flow [2022-12-13 02:26:00,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:00,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:00,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:00,838 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-13 02:26:01,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 02:26:01,035 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-13 02:26:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:01,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1563364417, now seen corresponding path program 1 times [2022-12-13 02:26:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:01,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643668844] [2022-12-13 02:26:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:01,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:01,143 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-13 02:26:01,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:01,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643668844] [2022-12-13 02:26:01,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643668844] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:01,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793107658] [2022-12-13 02:26:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:01,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:01,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:01,148 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-13 02:26:01,177 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-13 02:26:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:01,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:26:01,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:01,354 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-13 02:26:01,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:01,400 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-13 02:26:01,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793107658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:01,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:01,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 02:26:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173624223] [2022-12-13 02:26:01,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:01,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:26:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:26:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:26:01,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 02:26:01,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 187 transitions, 3989 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-13 02:26:01,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:01,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 02:26:01,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:02,580 INFO L130 PetriNetUnfolder]: 1116/2195 cut-off events. [2022-12-13 02:26:02,581 INFO L131 PetriNetUnfolder]: For 40329/40329 co-relation queries the response was YES. [2022-12-13 02:26:02,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17683 conditions, 2195 events. 1116/2195 cut-off events. For 40329/40329 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14461 event pairs, 285 based on Foata normal form. 49/2234 useless extension candidates. Maximal degree in co-relation 17295. Up to 899 conditions per place. [2022-12-13 02:26:02,605 INFO L137 encePairwiseOnDemand]: 17/57 looper letters, 135 selfloop transitions, 133 changer transitions 0/268 dead transitions. [2022-12-13 02:26:02,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 268 transitions, 5685 flow [2022-12-13 02:26:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:26:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:26:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 141 transitions. [2022-12-13 02:26:02,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1902834008097166 [2022-12-13 02:26:02,607 INFO L175 Difference]: Start difference. First operand has 132 places, 187 transitions, 3989 flow. Second operand 13 states and 141 transitions. [2022-12-13 02:26:02,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 268 transitions, 5685 flow [2022-12-13 02:26:02,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 268 transitions, 5589 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:02,733 INFO L231 Difference]: Finished difference. Result has 152 places, 208 transitions, 4874 flow [2022-12-13 02:26:02,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3939, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4874, PETRI_PLACES=152, PETRI_TRANSITIONS=208} [2022-12-13 02:26:02,733 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-13 02:26:02,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:02,733 INFO L89 Accepts]: Start accepts. Operand has 152 places, 208 transitions, 4874 flow [2022-12-13 02:26:02,735 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:02,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:02,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 208 transitions, 4874 flow [2022-12-13 02:26:02,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 208 transitions, 4874 flow [2022-12-13 02:26:02,832 INFO L130 PetriNetUnfolder]: 232/841 cut-off events. [2022-12-13 02:26:02,832 INFO L131 PetriNetUnfolder]: For 21358/21525 co-relation queries the response was YES. [2022-12-13 02:26:02,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7121 conditions, 841 events. 232/841 cut-off events. For 21358/21525 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6988 event pairs, 42 based on Foata normal form. 45/852 useless extension candidates. Maximal degree in co-relation 6934. Up to 276 conditions per place. [2022-12-13 02:26:02,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 208 transitions, 4874 flow [2022-12-13 02:26:02,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-13 02:26:04,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_292| v_~f~0.base_192))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_192 (* v_~x2~0_249 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_192 (* .cse7 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_192 (* .cse6 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_192 (* 4 .cse3))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_192 (* v_~x1~0_314 4)))) (.cse0 (* 2 (mod v_~n~0_195 2147483648))) (.cse5 (select .cse4 (+ v_~f~0.offset_192 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_263| 4294967295) 4294967296) .cse0) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_196)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_151|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_264| 4294967296) .cse0) (not (= (ite (and (< .cse2 v_~size~0_196) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_196) (<= 0 .cse3)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_206|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_249 v_~size~0_196) (<= 0 v_~x2~0_249)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_314 v_~size~0_196) (<= 0 v_~x1~0_314)) 1 0) 0)) (= v_~x2~0_247 (select .cse4 (+ v_~f~0.offset_192 (* .cse5 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_206| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_208|)) (= v_~x1~0_313 (select .cse4 (+ v_~f~0.offset_192 (* .cse1 4)))) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_206|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_196)) 1 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_196)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_263| (+ |v_thread1Thread1of1ForFork0_~i~0#1_264| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_151| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|)))))))) InVars {~x2~0=v_~x2~0_249, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_192, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_264|, #memory_int=|v_#memory_int_292|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_195, ~x1~0=v_~x1~0_314, ~f~0.offset=v_~f~0.offset_192} OutVars{~x2~0=v_~x2~0_247, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_169|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_192, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_206|, ~x1~0=v_~x1~0_313, ~f~0.offset=v_~f~0.offset_192, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_151|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_263|, #memory_int=|v_#memory_int_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_103|, ~n~0=v_~n~0_195, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_103|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_177|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:05,992 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:05,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3260 [2022-12-13 02:26:05,993 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 208 transitions, 4928 flow [2022-12-13 02:26:05,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-13 02:26:05,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:05,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:05,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 02:26:06,198 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-13 02:26:06,199 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-13 02:26:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash 542435676, now seen corresponding path program 2 times [2022-12-13 02:26:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:06,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320553817] [2022-12-13 02:26:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:06,661 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-13 02:26:06,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:06,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320553817] [2022-12-13 02:26:06,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320553817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:06,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518206383] [2022-12-13 02:26:06,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:26:06,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:06,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:06,664 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-13 02:26:06,666 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-13 02:26:06,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:26:06,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:26:06,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:26:06,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:06,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:06,833 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-13 02:26:06,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:06,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 02:26:06,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-13 02:26:06,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:06,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:06,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 02:26:07,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:07,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-13 02:26:07,162 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-13 02:26:07,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518206383] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:07,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:07,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:26:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074005458] [2022-12-13 02:26:07,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:07,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:26:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:07,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:26:07,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:26:07,164 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 02:26:07,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 208 transitions, 4928 flow. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:07,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:07,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 02:26:07,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:08,210 INFO L130 PetriNetUnfolder]: 1316/2559 cut-off events. [2022-12-13 02:26:08,210 INFO L131 PetriNetUnfolder]: For 68644/68644 co-relation queries the response was YES. [2022-12-13 02:26:08,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23632 conditions, 2559 events. 1316/2559 cut-off events. For 68644/68644 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 17195 event pairs, 540 based on Foata normal form. 4/2553 useless extension candidates. Maximal degree in co-relation 23217. Up to 2042 conditions per place. [2022-12-13 02:26:08,236 INFO L137 encePairwiseOnDemand]: 25/59 looper letters, 182 selfloop transitions, 78 changer transitions 12/272 dead transitions. [2022-12-13 02:26:08,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 272 transitions, 6316 flow [2022-12-13 02:26:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:26:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:26:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-12-13 02:26:08,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.211864406779661 [2022-12-13 02:26:08,239 INFO L175 Difference]: Start difference. First operand has 152 places, 208 transitions, 4928 flow. Second operand 10 states and 125 transitions. [2022-12-13 02:26:08,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 272 transitions, 6316 flow [2022-12-13 02:26:08,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 272 transitions, 5992 flow, removed 162 selfloop flow, removed 0 redundant places. [2022-12-13 02:26:08,457 INFO L231 Difference]: Finished difference. Result has 165 places, 227 transitions, 5285 flow [2022-12-13 02:26:08,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4670, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5285, PETRI_PLACES=165, PETRI_TRANSITIONS=227} [2022-12-13 02:26:08,458 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 144 predicate places. [2022-12-13 02:26:08,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:08,458 INFO L89 Accepts]: Start accepts. Operand has 165 places, 227 transitions, 5285 flow [2022-12-13 02:26:08,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:08,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:08,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 227 transitions, 5285 flow [2022-12-13 02:26:08,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 227 transitions, 5285 flow [2022-12-13 02:26:08,568 INFO L130 PetriNetUnfolder]: 275/966 cut-off events. [2022-12-13 02:26:08,568 INFO L131 PetriNetUnfolder]: For 28306/28538 co-relation queries the response was YES. [2022-12-13 02:26:08,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8515 conditions, 966 events. 275/966 cut-off events. For 28306/28538 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8169 event pairs, 53 based on Foata normal form. 36/954 useless extension candidates. Maximal degree in co-relation 8323. Up to 329 conditions per place. [2022-12-13 02:26:08,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 227 transitions, 5285 flow [2022-12-13 02:26:08,579 INFO L226 LiptonReduction]: Number of co-enabled transitions 718 [2022-12-13 02:26:08,580 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:08,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:26:08,581 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 227 transitions, 5285 flow [2022-12-13 02:26:08,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:08,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:08,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:08,587 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-13 02:26:08,787 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,SelfDestructingSolverStorable27 [2022-12-13 02:26:08,787 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-13 02:26:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1992007668, now seen corresponding path program 1 times [2022-12-13 02:26:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:08,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371566048] [2022-12-13 02:26:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:08,951 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-13 02:26:08,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371566048] [2022-12-13 02:26:08,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371566048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:08,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48877817] [2022-12-13 02:26:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:08,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:08,956 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-13 02:26:08,975 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-13 02:26:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:09,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:26:09,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:09,171 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-13 02:26:09,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:09,217 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-13 02:26:09,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48877817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:09,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:09,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 02:26:09,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931858787] [2022-12-13 02:26:09,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:09,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:26:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:09,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:26:09,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:26:09,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 02:26:09,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 227 transitions, 5285 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:09,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:09,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 02:26:09,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:10,306 INFO L130 PetriNetUnfolder]: 1375/2659 cut-off events. [2022-12-13 02:26:10,306 INFO L131 PetriNetUnfolder]: For 78201/78201 co-relation queries the response was YES. [2022-12-13 02:26:10,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24795 conditions, 2659 events. 1375/2659 cut-off events. For 78201/78201 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18002 event pairs, 651 based on Foata normal form. 8/2657 useless extension candidates. Maximal degree in co-relation 24375. Up to 2339 conditions per place. [2022-12-13 02:26:10,327 INFO L137 encePairwiseOnDemand]: 37/58 looper letters, 207 selfloop transitions, 59 changer transitions 7/273 dead transitions. [2022-12-13 02:26:10,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 273 transitions, 6636 flow [2022-12-13 02:26:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:26:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:26:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-13 02:26:10,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20114942528735633 [2022-12-13 02:26:10,329 INFO L175 Difference]: Start difference. First operand has 164 places, 227 transitions, 5285 flow. Second operand 9 states and 105 transitions. [2022-12-13 02:26:10,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 273 transitions, 6636 flow [2022-12-13 02:26:10,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 273 transitions, 6406 flow, removed 88 selfloop flow, removed 5 redundant places. [2022-12-13 02:26:10,497 INFO L231 Difference]: Finished difference. Result has 172 places, 239 transitions, 5610 flow [2022-12-13 02:26:10,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=5109, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5610, PETRI_PLACES=172, PETRI_TRANSITIONS=239} [2022-12-13 02:26:10,498 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 151 predicate places. [2022-12-13 02:26:10,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:10,498 INFO L89 Accepts]: Start accepts. Operand has 172 places, 239 transitions, 5610 flow [2022-12-13 02:26:10,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:10,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:10,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 239 transitions, 5610 flow [2022-12-13 02:26:10,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 239 transitions, 5610 flow [2022-12-13 02:26:10,617 INFO L130 PetriNetUnfolder]: 288/1008 cut-off events. [2022-12-13 02:26:10,617 INFO L131 PetriNetUnfolder]: For 30870/31088 co-relation queries the response was YES. [2022-12-13 02:26:10,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9010 conditions, 1008 events. 288/1008 cut-off events. For 30870/31088 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8607 event pairs, 54 based on Foata normal form. 26/985 useless extension candidates. Maximal degree in co-relation 8813. Up to 348 conditions per place. [2022-12-13 02:26:10,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 239 transitions, 5610 flow [2022-12-13 02:26:10,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 02:26:10,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_295| v_~f~0.base_194))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_194 (* v_~x2~0_258 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_194 (* 4 .cse8))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_194 (* .cse0 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_194 (* .cse6 4))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_194 (* .cse3 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_194 (* .cse7 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_194 (* v_~x1~0_322 4)))) (.cse2 (* (mod v_~n~0_197 2147483648) 2)) (.cse5 (select .cse4 (+ v_~f~0.offset_194 (* .cse9 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_216| (+ |v_thread2Thread1of1ForFork1_~i~1#1_218| 8)) (not (= (ite (and (< .cse0 v_~size~0_198) (<= 0 .cse0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_198)) 1 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_216|) 4294967296) .cse2) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_216|) 4294967296) .cse2) (< (mod (+ 4294967290 |v_thread2Thread1of1ForFork1_~i~1#1_216|) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_198)) 1 0) 0)) (= v_~x2~0_256 (select .cse4 (+ v_~f~0.offset_194 (* .cse5 4)))) (not (= (ite (and (< .cse6 v_~size~0_198) (<= 0 .cse6)) 1 0) 0)) (= v_~x1~0_321 (select .cse4 (+ v_~f~0.offset_194 (* 4 .cse1)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_272| 4294967295) 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_198)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_273| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x1~0_322) (< v_~x1~0_322 v_~size~0_198)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_218| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_198)) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_273| 2) |v_thread1Thread1of1ForFork0_~i~0#1_272|) (not (= (ite (and (< .cse7 v_~size~0_198) (<= 0 .cse7)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|) (not (= (ite (and (< .cse8 v_~size~0_198) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_198)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_194, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_273|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_218|, ~n~0=v_~n~0_197, ~x1~0=v_~x1~0_322, ~f~0.offset=v_~f~0.offset_194} OutVars{~x2~0=v_~x2~0_256, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_175|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_121|, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_194, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_216|, ~x1~0=v_~x1~0_321, ~f~0.offset=v_~f~0.offset_194, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_272|, #memory_int=|v_#memory_int_295|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_111|, ~n~0=v_~n~0_197, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_111|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_183|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:14,005 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:14,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3509 [2022-12-13 02:26:14,007 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 239 transitions, 5645 flow [2022-12-13 02:26:14,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:14,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:14,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:14,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:14,215 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,SelfDestructingSolverStorable28 [2022-12-13 02:26:14,216 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-13 02:26:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -980016756, now seen corresponding path program 1 times [2022-12-13 02:26:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:14,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132310629] [2022-12-13 02:26:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:14,290 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-13 02:26:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:14,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132310629] [2022-12-13 02:26:14,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132310629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:14,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:14,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:26:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493024548] [2022-12-13 02:26:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:14,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 02:26:14,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 239 transitions, 5645 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-13 02:26:14,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:14,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 02:26:14,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:14,959 INFO L130 PetriNetUnfolder]: 1361/2644 cut-off events. [2022-12-13 02:26:14,959 INFO L131 PetriNetUnfolder]: For 79011/79011 co-relation queries the response was YES. [2022-12-13 02:26:14,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24678 conditions, 2644 events. 1361/2644 cut-off events. For 79011/79011 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 17983 event pairs, 562 based on Foata normal form. 12/2646 useless extension candidates. Maximal degree in co-relation 24253. Up to 1938 conditions per place. [2022-12-13 02:26:14,981 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 181 selfloop transitions, 83 changer transitions 5/269 dead transitions. [2022-12-13 02:26:14,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 269 transitions, 6613 flow [2022-12-13 02:26:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 02:26:14,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29491525423728815 [2022-12-13 02:26:14,982 INFO L175 Difference]: Start difference. First operand has 172 places, 239 transitions, 5645 flow. Second operand 5 states and 87 transitions. [2022-12-13 02:26:14,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 269 transitions, 6613 flow [2022-12-13 02:26:15,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 269 transitions, 6449 flow, removed 65 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:15,160 INFO L231 Difference]: Finished difference. Result has 177 places, 240 transitions, 5776 flow [2022-12-13 02:26:15,161 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=5481, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5776, PETRI_PLACES=177, PETRI_TRANSITIONS=240} [2022-12-13 02:26:15,161 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 156 predicate places. [2022-12-13 02:26:15,161 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:15,161 INFO L89 Accepts]: Start accepts. Operand has 177 places, 240 transitions, 5776 flow [2022-12-13 02:26:15,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:15,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:15,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 240 transitions, 5776 flow [2022-12-13 02:26:15,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 240 transitions, 5776 flow [2022-12-13 02:26:15,291 INFO L130 PetriNetUnfolder]: 285/1002 cut-off events. [2022-12-13 02:26:15,292 INFO L131 PetriNetUnfolder]: For 33057/33269 co-relation queries the response was YES. [2022-12-13 02:26:15,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9221 conditions, 1002 events. 285/1002 cut-off events. For 33057/33269 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8571 event pairs, 54 based on Foata normal form. 33/988 useless extension candidates. Maximal degree in co-relation 9008. Up to 347 conditions per place. [2022-12-13 02:26:15,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 240 transitions, 5776 flow [2022-12-13 02:26:15,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 02:26:15,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:15,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:15,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [633] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_231| v_~f~0.base_140))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_140 (* v_~x2~0_148 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_140 (* .cse1 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_140 (* .cse4 4)))) (.cse3 (* 2 (mod v_~n~0_145 2147483648)))) (and (= (ite (and (< .cse0 v_~size~0_146) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= (ite (and (< v_~x2~0_148 v_~size~0_146) (<= 0 v_~x2~0_148)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_110| (+ |v_thread2Thread1of1ForFork1_~i~1#1_112| 4)) (not (= (ite (and (< .cse1 v_~size~0_146) (<= 0 .cse1)) 1 0) 0)) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_140 (* .cse0 4)))) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_112|) 4294967296) .cse3) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= (ite (and (< .cse4 v_~size~0_146) (<= 0 .cse4)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_112| 4294967296) .cse3)))))) InVars {~x2~0=v_~x2~0_148, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_140, #memory_int=|v_#memory_int_231|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~n~0=v_~n~0_145, ~f~0.offset=v_~f~0.offset_140} OutVars{~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_140, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_110|, ~f~0.offset=v_~f~0.offset_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, #memory_int=|v_#memory_int_231|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_145, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:15,844 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:26:15,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 684 [2022-12-13 02:26:15,845 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 240 transitions, 5789 flow [2022-12-13 02:26:15,845 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-13 02:26:15,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:15,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:15,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 02:26:15,846 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-13 02:26:15,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash -558960001, now seen corresponding path program 1 times [2022-12-13 02:26:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:15,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25610241] [2022-12-13 02:26:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:16,014 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-13 02:26:16,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:16,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25610241] [2022-12-13 02:26:16,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25610241] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:16,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568455611] [2022-12-13 02:26:16,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:16,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:16,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:16,017 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-13 02:26:16,019 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-13 02:26:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:16,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:26:16,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:16,222 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-13 02:26:16,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:16,262 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-13 02:26:16,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568455611] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:16,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:16,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 02:26:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537843160] [2022-12-13 02:26:16,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:16,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:26:16,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:16,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:26:16,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:26:16,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:26:16,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 240 transitions, 5789 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 02:26:16,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:16,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:26:16,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:17,133 INFO L130 PetriNetUnfolder]: 1383/2679 cut-off events. [2022-12-13 02:26:17,133 INFO L131 PetriNetUnfolder]: For 86579/86579 co-relation queries the response was YES. [2022-12-13 02:26:17,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25778 conditions, 2679 events. 1383/2679 cut-off events. For 86579/86579 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 18156 event pairs, 641 based on Foata normal form. 8/2677 useless extension candidates. Maximal degree in co-relation 25315. Up to 2321 conditions per place. [2022-12-13 02:26:17,155 INFO L137 encePairwiseOnDemand]: 38/60 looper letters, 205 selfloop transitions, 64 changer transitions 7/276 dead transitions. [2022-12-13 02:26:17,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 276 transitions, 6920 flow [2022-12-13 02:26:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:26:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:26:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-13 02:26:17,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21458333333333332 [2022-12-13 02:26:17,157 INFO L175 Difference]: Start difference. First operand has 178 places, 240 transitions, 5789 flow. Second operand 8 states and 103 transitions. [2022-12-13 02:26:17,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 276 transitions, 6920 flow [2022-12-13 02:26:17,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 276 transitions, 6814 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 02:26:17,359 INFO L231 Difference]: Finished difference. Result has 185 places, 245 transitions, 6034 flow [2022-12-13 02:26:17,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5686, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6034, PETRI_PLACES=185, PETRI_TRANSITIONS=245} [2022-12-13 02:26:17,360 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-13 02:26:17,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:17,360 INFO L89 Accepts]: Start accepts. Operand has 185 places, 245 transitions, 6034 flow [2022-12-13 02:26:17,362 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:17,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:17,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 245 transitions, 6034 flow [2022-12-13 02:26:17,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 245 transitions, 6034 flow [2022-12-13 02:26:17,495 INFO L130 PetriNetUnfolder]: 291/1019 cut-off events. [2022-12-13 02:26:17,496 INFO L131 PetriNetUnfolder]: For 36792/37016 co-relation queries the response was YES. [2022-12-13 02:26:17,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9629 conditions, 1019 events. 291/1019 cut-off events. For 36792/37016 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8738 event pairs, 55 based on Foata normal form. 33/1004 useless extension candidates. Maximal degree in co-relation 9419. Up to 356 conditions per place. [2022-12-13 02:26:17,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 245 transitions, 6034 flow [2022-12-13 02:26:17,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-13 02:26:17,509 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:17,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 02:26:17,510 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 245 transitions, 6034 flow [2022-12-13 02:26:17,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 02:26:17,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:17,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:17,515 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-13 02:26:17,712 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,SelfDestructingSolverStorable30 [2022-12-13 02:26:17,712 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-13 02:26:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash 107590778, now seen corresponding path program 2 times [2022-12-13 02:26:17,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:17,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41340691] [2022-12-13 02:26:17,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:17,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:17,794 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-13 02:26:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:17,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41340691] [2022-12-13 02:26:17,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41340691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:17,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:17,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:26:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502350534] [2022-12-13 02:26:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:17,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:26:17,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 245 transitions, 6034 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-13 02:26:17,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:17,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:26:17,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:18,468 INFO L130 PetriNetUnfolder]: 1378/2695 cut-off events. [2022-12-13 02:26:18,468 INFO L131 PetriNetUnfolder]: For 91955/91955 co-relation queries the response was YES. [2022-12-13 02:26:18,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26270 conditions, 2695 events. 1378/2695 cut-off events. For 91955/91955 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18464 event pairs, 576 based on Foata normal form. 4/2689 useless extension candidates. Maximal degree in co-relation 25820. Up to 1986 conditions per place. [2022-12-13 02:26:18,491 INFO L137 encePairwiseOnDemand]: 20/60 looper letters, 172 selfloop transitions, 99 changer transitions 3/274 dead transitions. [2022-12-13 02:26:18,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 274 transitions, 7015 flow [2022-12-13 02:26:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 02:26:18,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 02:26:18,492 INFO L175 Difference]: Start difference. First operand has 185 places, 245 transitions, 6034 flow. Second operand 5 states and 90 transitions. [2022-12-13 02:26:18,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 274 transitions, 7015 flow [2022-12-13 02:26:18,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 274 transitions, 6854 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-13 02:26:18,727 INFO L231 Difference]: Finished difference. Result has 187 places, 247 transitions, 6182 flow [2022-12-13 02:26:18,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5878, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6182, PETRI_PLACES=187, PETRI_TRANSITIONS=247} [2022-12-13 02:26:18,728 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-13 02:26:18,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:18,728 INFO L89 Accepts]: Start accepts. Operand has 187 places, 247 transitions, 6182 flow [2022-12-13 02:26:18,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:18,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:18,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 247 transitions, 6182 flow [2022-12-13 02:26:18,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 247 transitions, 6182 flow [2022-12-13 02:26:18,857 INFO L130 PetriNetUnfolder]: 289/1031 cut-off events. [2022-12-13 02:26:18,857 INFO L131 PetriNetUnfolder]: For 37263/37466 co-relation queries the response was YES. [2022-12-13 02:26:18,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9804 conditions, 1031 events. 289/1031 cut-off events. For 37263/37466 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8948 event pairs, 53 based on Foata normal form. 28/1015 useless extension candidates. Maximal degree in co-relation 9579. Up to 351 conditions per place. [2022-12-13 02:26:18,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 247 transitions, 6182 flow [2022-12-13 02:26:18,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-13 02:26:18,870 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:18,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:26:18,871 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 247 transitions, 6182 flow [2022-12-13 02:26:18,871 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-13 02:26:18,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:18,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:18,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 02:26:18,872 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-13 02:26:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -329889358, now seen corresponding path program 1 times [2022-12-13 02:26:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:18,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666956154] [2022-12-13 02:26:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:19,417 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-13 02:26:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:19,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666956154] [2022-12-13 02:26:19,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666956154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:19,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:19,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:19,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250562954] [2022-12-13 02:26:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:19,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:19,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:19,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:26:19,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 247 transitions, 6182 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-13 02:26:19,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:19,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:26:19,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:20,305 INFO L130 PetriNetUnfolder]: 1415/2766 cut-off events. [2022-12-13 02:26:20,305 INFO L131 PetriNetUnfolder]: For 92240/92240 co-relation queries the response was YES. [2022-12-13 02:26:20,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27182 conditions, 2766 events. 1415/2766 cut-off events. For 92240/92240 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 18976 event pairs, 401 based on Foata normal form. 3/2759 useless extension candidates. Maximal degree in co-relation 26700. Up to 2242 conditions per place. [2022-12-13 02:26:20,331 INFO L137 encePairwiseOnDemand]: 20/60 looper letters, 175 selfloop transitions, 93 changer transitions 8/276 dead transitions. [2022-12-13 02:26:20,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 276 transitions, 7125 flow [2022-12-13 02:26:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 02:26:20,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30333333333333334 [2022-12-13 02:26:20,332 INFO L175 Difference]: Start difference. First operand has 187 places, 247 transitions, 6182 flow. Second operand 5 states and 91 transitions. [2022-12-13 02:26:20,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 276 transitions, 7125 flow [2022-12-13 02:26:20,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 276 transitions, 6902 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-13 02:26:20,620 INFO L231 Difference]: Finished difference. Result has 190 places, 255 transitions, 6474 flow [2022-12-13 02:26:20,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5980, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6474, PETRI_PLACES=190, PETRI_TRANSITIONS=255} [2022-12-13 02:26:20,621 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 169 predicate places. [2022-12-13 02:26:20,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:20,621 INFO L89 Accepts]: Start accepts. Operand has 190 places, 255 transitions, 6474 flow [2022-12-13 02:26:20,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:20,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:20,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 255 transitions, 6474 flow [2022-12-13 02:26:20,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 255 transitions, 6474 flow [2022-12-13 02:26:20,776 INFO L130 PetriNetUnfolder]: 296/1063 cut-off events. [2022-12-13 02:26:20,776 INFO L131 PetriNetUnfolder]: For 38779/38990 co-relation queries the response was YES. [2022-12-13 02:26:20,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 1063 events. 296/1063 cut-off events. For 38779/38990 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9288 event pairs, 54 based on Foata normal form. 29/1047 useless extension candidates. Maximal degree in co-relation 9834. Up to 354 conditions per place. [2022-12-13 02:26:20,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 255 transitions, 6474 flow [2022-12-13 02:26:20,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 02:26:20,790 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:20,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 02:26:20,791 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 255 transitions, 6474 flow [2022-12-13 02:26:20,791 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-13 02:26:20,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:20,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:20,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 02:26:20,791 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-13 02:26:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash -517894423, now seen corresponding path program 1 times [2022-12-13 02:26:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:20,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943105307] [2022-12-13 02:26:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:21,506 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-13 02:26:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943105307] [2022-12-13 02:26:21,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943105307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:21,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125416572] [2022-12-13 02:26:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:21,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:21,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:26:21,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 255 transitions, 6474 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-13 02:26:21,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:21,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:26:21,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:22,398 INFO L130 PetriNetUnfolder]: 1433/2792 cut-off events. [2022-12-13 02:26:22,399 INFO L131 PetriNetUnfolder]: For 94828/94828 co-relation queries the response was YES. [2022-12-13 02:26:22,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27471 conditions, 2792 events. 1433/2792 cut-off events. For 94828/94828 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 19162 event pairs, 484 based on Foata normal form. 1/2783 useless extension candidates. Maximal degree in co-relation 26988. Up to 2570 conditions per place. [2022-12-13 02:26:22,425 INFO L137 encePairwiseOnDemand]: 26/60 looper letters, 211 selfloop transitions, 61 changer transitions 4/276 dead transitions. [2022-12-13 02:26:22,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 276 transitions, 7324 flow [2022-12-13 02:26:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 02:26:22,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 02:26:22,428 INFO L175 Difference]: Start difference. First operand has 190 places, 255 transitions, 6474 flow. Second operand 5 states and 90 transitions. [2022-12-13 02:26:22,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 276 transitions, 7324 flow [2022-12-13 02:26:22,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 276 transitions, 7174 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 02:26:22,725 INFO L231 Difference]: Finished difference. Result has 193 places, 260 transitions, 6666 flow [2022-12-13 02:26:22,725 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=6327, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6666, PETRI_PLACES=193, PETRI_TRANSITIONS=260} [2022-12-13 02:26:22,725 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 172 predicate places. [2022-12-13 02:26:22,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:22,725 INFO L89 Accepts]: Start accepts. Operand has 193 places, 260 transitions, 6666 flow [2022-12-13 02:26:22,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:22,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:22,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 260 transitions, 6666 flow [2022-12-13 02:26:22,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 260 transitions, 6666 flow [2022-12-13 02:26:22,857 INFO L130 PetriNetUnfolder]: 301/1075 cut-off events. [2022-12-13 02:26:22,857 INFO L131 PetriNetUnfolder]: For 40474/40695 co-relation queries the response was YES. [2022-12-13 02:26:22,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10255 conditions, 1075 events. 301/1075 cut-off events. For 40474/40695 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9398 event pairs, 55 based on Foata normal form. 30/1057 useless extension candidates. Maximal degree in co-relation 10030. Up to 356 conditions per place. [2022-12-13 02:26:22,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 260 transitions, 6666 flow [2022-12-13 02:26:22,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-13 02:26:22,871 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:22,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:26:22,871 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 260 transitions, 6666 flow [2022-12-13 02:26:22,871 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-13 02:26:22,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:22,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:22,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 02:26:22,872 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-13 02:26:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1956202965, now seen corresponding path program 1 times [2022-12-13 02:26:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:22,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658792515] [2022-12-13 02:26:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:22,950 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-13 02:26:22,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:22,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658792515] [2022-12-13 02:26:22,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658792515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:22,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:22,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:26:22,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647967919] [2022-12-13 02:26:22,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:22,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:22,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:26:22,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 260 transitions, 6666 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:22,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:22,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:26:22,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:23,806 INFO L130 PetriNetUnfolder]: 1664/3225 cut-off events. [2022-12-13 02:26:23,806 INFO L131 PetriNetUnfolder]: For 118549/118549 co-relation queries the response was YES. [2022-12-13 02:26:23,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32171 conditions, 3225 events. 1664/3225 cut-off events. For 118549/118549 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 22523 event pairs, 548 based on Foata normal form. 4/3219 useless extension candidates. Maximal degree in co-relation 31624. Up to 2006 conditions per place. [2022-12-13 02:26:23,837 INFO L137 encePairwiseOnDemand]: 22/60 looper letters, 184 selfloop transitions, 134 changer transitions 2/320 dead transitions. [2022-12-13 02:26:23,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 320 transitions, 8307 flow [2022-12-13 02:26:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:26:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:26:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-13 02:26:23,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24761904761904763 [2022-12-13 02:26:23,838 INFO L175 Difference]: Start difference. First operand has 193 places, 260 transitions, 6666 flow. Second operand 7 states and 104 transitions. [2022-12-13 02:26:23,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 320 transitions, 8307 flow [2022-12-13 02:26:24,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 320 transitions, 8177 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:24,145 INFO L231 Difference]: Finished difference. Result has 201 places, 279 transitions, 7464 flow [2022-12-13 02:26:24,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=6542, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7464, PETRI_PLACES=201, PETRI_TRANSITIONS=279} [2022-12-13 02:26:24,146 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 180 predicate places. [2022-12-13 02:26:24,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:24,146 INFO L89 Accepts]: Start accepts. Operand has 201 places, 279 transitions, 7464 flow [2022-12-13 02:26:24,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:24,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:24,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 279 transitions, 7464 flow [2022-12-13 02:26:24,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 279 transitions, 7464 flow [2022-12-13 02:26:24,379 INFO L130 PetriNetUnfolder]: 344/1215 cut-off events. [2022-12-13 02:26:24,379 INFO L131 PetriNetUnfolder]: For 49638/49905 co-relation queries the response was YES. [2022-12-13 02:26:24,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12060 conditions, 1215 events. 344/1215 cut-off events. For 49638/49905 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10839 event pairs, 70 based on Foata normal form. 32/1187 useless extension candidates. Maximal degree in co-relation 11800. Up to 426 conditions per place. [2022-12-13 02:26:24,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 279 transitions, 7464 flow [2022-12-13 02:26:24,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 02:26:24,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:24,510 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:24,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-13 02:26:24,511 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 278 transitions, 7460 flow [2022-12-13 02:26:24,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:24,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:24,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:24,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 02:26:24,511 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-13 02:26:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2011078081, now seen corresponding path program 2 times [2022-12-13 02:26:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:24,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451322845] [2022-12-13 02:26:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:24,581 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-13 02:26:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:24,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451322845] [2022-12-13 02:26:24,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451322845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:24,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:24,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:26:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762532888] [2022-12-13 02:26:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:24,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:24,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 02:26:24,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 278 transitions, 7460 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:24,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:24,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 02:26:24,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:25,500 INFO L130 PetriNetUnfolder]: 1671/3228 cut-off events. [2022-12-13 02:26:25,500 INFO L131 PetriNetUnfolder]: For 124286/124286 co-relation queries the response was YES. [2022-12-13 02:26:25,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33314 conditions, 3228 events. 1671/3228 cut-off events. For 124286/124286 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 22436 event pairs, 362 based on Foata normal form. 22/3240 useless extension candidates. Maximal degree in co-relation 32746. Up to 1861 conditions per place. [2022-12-13 02:26:25,537 INFO L137 encePairwiseOnDemand]: 20/61 looper letters, 207 selfloop transitions, 123 changer transitions 0/330 dead transitions. [2022-12-13 02:26:25,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 330 transitions, 8971 flow [2022-12-13 02:26:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:26:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:26:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-13 02:26:25,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19672131147540983 [2022-12-13 02:26:25,539 INFO L175 Difference]: Start difference. First operand has 200 places, 278 transitions, 7460 flow. Second operand 9 states and 108 transitions. [2022-12-13 02:26:25,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 330 transitions, 8971 flow [2022-12-13 02:26:25,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 330 transitions, 8900 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-13 02:26:25,880 INFO L231 Difference]: Finished difference. Result has 209 places, 282 transitions, 7806 flow [2022-12-13 02:26:25,880 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=7388, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7806, PETRI_PLACES=209, PETRI_TRANSITIONS=282} [2022-12-13 02:26:25,880 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-13 02:26:25,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:25,881 INFO L89 Accepts]: Start accepts. Operand has 209 places, 282 transitions, 7806 flow [2022-12-13 02:26:25,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:25,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:25,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 282 transitions, 7806 flow [2022-12-13 02:26:25,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 282 transitions, 7806 flow [2022-12-13 02:26:26,114 INFO L130 PetriNetUnfolder]: 348/1218 cut-off events. [2022-12-13 02:26:26,114 INFO L131 PetriNetUnfolder]: For 50696/50951 co-relation queries the response was YES. [2022-12-13 02:26:26,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12439 conditions, 1218 events. 348/1218 cut-off events. For 50696/50951 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 10869 event pairs, 70 based on Foata normal form. 26/1184 useless extension candidates. Maximal degree in co-relation 12170. Up to 433 conditions per place. [2022-12-13 02:26:26,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 282 transitions, 7806 flow [2022-12-13 02:26:26,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-13 02:26:26,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:26,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:26,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 863 [2022-12-13 02:26:26,744 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 282 transitions, 7834 flow [2022-12-13 02:26:26,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:26,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:26,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:26,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 02:26:26,744 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-13 02:26:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1021788795, now seen corresponding path program 1 times [2022-12-13 02:26:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:26,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679843376] [2022-12-13 02:26:26,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:26,836 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-13 02:26:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679843376] [2022-12-13 02:26:26,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679843376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:26,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:26,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722830720] [2022-12-13 02:26:26,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:26,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:26:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:26:26,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:26:26,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:26,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 282 transitions, 7834 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-13 02:26:26,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:26,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:26,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:27,853 INFO L130 PetriNetUnfolder]: 1665/3206 cut-off events. [2022-12-13 02:26:27,854 INFO L131 PetriNetUnfolder]: For 126752/126752 co-relation queries the response was YES. [2022-12-13 02:26:27,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33879 conditions, 3206 events. 1665/3206 cut-off events. For 126752/126752 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 22445 event pairs, 212 based on Foata normal form. 2/3196 useless extension candidates. Maximal degree in co-relation 33290. Up to 1693 conditions per place. [2022-12-13 02:26:27,883 INFO L137 encePairwiseOnDemand]: 49/63 looper letters, 306 selfloop transitions, 30 changer transitions 8/344 dead transitions. [2022-12-13 02:26:27,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 344 transitions, 9964 flow [2022-12-13 02:26:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:26:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:26:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 02:26:27,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30158730158730157 [2022-12-13 02:26:27,884 INFO L175 Difference]: Start difference. First operand has 209 places, 282 transitions, 7834 flow. Second operand 4 states and 76 transitions. [2022-12-13 02:26:27,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 344 transitions, 9964 flow [2022-12-13 02:26:28,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 344 transitions, 9887 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-13 02:26:28,192 INFO L231 Difference]: Finished difference. Result has 212 places, 280 transitions, 7786 flow [2022-12-13 02:26:28,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=7771, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7786, PETRI_PLACES=212, PETRI_TRANSITIONS=280} [2022-12-13 02:26:28,193 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2022-12-13 02:26:28,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:28,193 INFO L89 Accepts]: Start accepts. Operand has 212 places, 280 transitions, 7786 flow [2022-12-13 02:26:28,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:28,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:28,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 280 transitions, 7786 flow [2022-12-13 02:26:28,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 280 transitions, 7786 flow [2022-12-13 02:26:28,410 INFO L130 PetriNetUnfolder]: 347/1199 cut-off events. [2022-12-13 02:26:28,410 INFO L131 PetriNetUnfolder]: For 54422/54677 co-relation queries the response was YES. [2022-12-13 02:26:28,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12453 conditions, 1199 events. 347/1199 cut-off events. For 54422/54677 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10618 event pairs, 70 based on Foata normal form. 26/1166 useless extension candidates. Maximal degree in co-relation 12180. Up to 430 conditions per place. [2022-12-13 02:26:28,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 280 transitions, 7786 flow [2022-12-13 02:26:28,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-13 02:26:28,443 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:28,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:28,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 611 [2022-12-13 02:26:28,804 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 280 transitions, 7814 flow [2022-12-13 02:26:28,804 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-13 02:26:28,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:28,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:28,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 02:26:28,804 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-13 02:26:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1067657384, now seen corresponding path program 1 times [2022-12-13 02:26:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:28,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863060284] [2022-12-13 02:26:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863060284] [2022-12-13 02:26:28,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863060284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068451196] [2022-12-13 02:26:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:28,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:28,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:28,968 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-13 02:26:28,996 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-13 02:26:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:29,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:26:29,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:29,144 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-13 02:26:29,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:29,191 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-13 02:26:29,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068451196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:29,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:29,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-13 02:26:29,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685561045] [2022-12-13 02:26:29,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:29,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:26:29,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:26:29,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:26:29,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 02:26:29,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 280 transitions, 7814 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:29,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:29,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 02:26:29,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:30,878 INFO L130 PetriNetUnfolder]: 1715/3298 cut-off events. [2022-12-13 02:26:30,879 INFO L131 PetriNetUnfolder]: For 146004/146004 co-relation queries the response was YES. [2022-12-13 02:26:30,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35378 conditions, 3298 events. 1715/3298 cut-off events. For 146004/146004 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 23035 event pairs, 682 based on Foata normal form. 46/3332 useless extension candidates. Maximal degree in co-relation 34780. Up to 2145 conditions per place. [2022-12-13 02:26:30,918 INFO L137 encePairwiseOnDemand]: 19/64 looper letters, 198 selfloop transitions, 150 changer transitions 5/353 dead transitions. [2022-12-13 02:26:30,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 353 transitions, 9892 flow [2022-12-13 02:26:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:26:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:26:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-12-13 02:26:30,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17307692307692307 [2022-12-13 02:26:30,919 INFO L175 Difference]: Start difference. First operand has 211 places, 280 transitions, 7814 flow. Second operand 13 states and 144 transitions. [2022-12-13 02:26:30,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 353 transitions, 9892 flow [2022-12-13 02:26:31,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 353 transitions, 9700 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-13 02:26:31,352 INFO L231 Difference]: Finished difference. Result has 226 places, 301 transitions, 8663 flow [2022-12-13 02:26:31,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=7638, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8663, PETRI_PLACES=226, PETRI_TRANSITIONS=301} [2022-12-13 02:26:31,352 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 205 predicate places. [2022-12-13 02:26:31,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:31,352 INFO L89 Accepts]: Start accepts. Operand has 226 places, 301 transitions, 8663 flow [2022-12-13 02:26:31,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:31,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:31,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 301 transitions, 8663 flow [2022-12-13 02:26:31,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 301 transitions, 8663 flow [2022-12-13 02:26:31,542 INFO L130 PetriNetUnfolder]: 365/1244 cut-off events. [2022-12-13 02:26:31,542 INFO L131 PetriNetUnfolder]: For 65906/66304 co-relation queries the response was YES. [2022-12-13 02:26:31,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14278 conditions, 1244 events. 365/1244 cut-off events. For 65906/66304 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 11017 event pairs, 70 based on Foata normal form. 31/1219 useless extension candidates. Maximal degree in co-relation 14168. Up to 448 conditions per place. [2022-12-13 02:26:31,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 301 transitions, 8663 flow [2022-12-13 02:26:31,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-13 02:26:31,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:31,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-13 02:26:32,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:32,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [681] L49-2-->thread2EXIT: Formula: (let ((.cse0 (* 2 (mod v_~n~0_225 2147483648)))) (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_43| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_334| (+ |v_thread1Thread1of1ForFork0_~i~0#1_335| 1)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_269| 4294967296) .cse0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| (ite (and (< v_~x1~0_378 v_~size~0_226) (<= 0 v_~x1~0_378)) 1 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_335| 4294967296) .cse0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_43|) (= v_~x1~0_377 (select (select |v_#memory_int_326| v_~f~0.base_222) (+ v_~f~0.offset_222 (* v_~x1~0_378 4)))))) InVars {~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_222, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_335|, #memory_int=|v_#memory_int_326|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_269|, ~n~0=v_~n~0_225, ~x1~0=v_~x1~0_378, ~f~0.offset=v_~f~0.offset_222} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_210|, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_222, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_43|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_269|, ~x1~0=v_~x1~0_377, ~f~0.offset=v_~f~0.offset_222, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_43|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_334|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|, #memory_int=|v_#memory_int_326|, ~n~0=v_~n~0_225, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_218|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:32,688 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:26:32,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1336 [2022-12-13 02:26:32,688 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 300 transitions, 8747 flow [2022-12-13 02:26:32,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:32,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:32,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:32,696 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-13 02:26:32,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:32,897 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-13 02:26:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -81762572, now seen corresponding path program 2 times [2022-12-13 02:26:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:32,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493468212] [2022-12-13 02:26:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:33,020 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-13 02:26:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:33,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493468212] [2022-12-13 02:26:33,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493468212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:33,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:33,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:26:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665061126] [2022-12-13 02:26:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:33,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:33,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:33,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-13 02:26:33,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 300 transitions, 8747 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-13 02:26:33,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:33,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-13 02:26:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:34,087 INFO L130 PetriNetUnfolder]: 1706/3285 cut-off events. [2022-12-13 02:26:34,087 INFO L131 PetriNetUnfolder]: For 162481/162481 co-relation queries the response was YES. [2022-12-13 02:26:34,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38306 conditions, 3285 events. 1706/3285 cut-off events. For 162481/162481 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22892 event pairs, 852 based on Foata normal form. 4/3279 useless extension candidates. Maximal degree in co-relation 37995. Up to 3135 conditions per place. [2022-12-13 02:26:34,118 INFO L137 encePairwiseOnDemand]: 47/69 looper letters, 283 selfloop transitions, 30 changer transitions 6/319 dead transitions. [2022-12-13 02:26:34,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 319 transitions, 9764 flow [2022-12-13 02:26:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 02:26:34,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.263768115942029 [2022-12-13 02:26:34,119 INFO L175 Difference]: Start difference. First operand has 224 places, 300 transitions, 8747 flow. Second operand 5 states and 91 transitions. [2022-12-13 02:26:34,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 319 transitions, 9764 flow [2022-12-13 02:26:34,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 319 transitions, 9571 flow, removed 91 selfloop flow, removed 3 redundant places. [2022-12-13 02:26:34,542 INFO L231 Difference]: Finished difference. Result has 226 places, 301 transitions, 8685 flow [2022-12-13 02:26:34,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=8558, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8685, PETRI_PLACES=226, PETRI_TRANSITIONS=301} [2022-12-13 02:26:34,543 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 205 predicate places. [2022-12-13 02:26:34,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:34,543 INFO L89 Accepts]: Start accepts. Operand has 226 places, 301 transitions, 8685 flow [2022-12-13 02:26:34,545 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:34,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:34,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 301 transitions, 8685 flow [2022-12-13 02:26:34,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 301 transitions, 8685 flow [2022-12-13 02:26:34,719 INFO L130 PetriNetUnfolder]: 364/1207 cut-off events. [2022-12-13 02:26:34,720 INFO L131 PetriNetUnfolder]: For 68561/69026 co-relation queries the response was YES. [2022-12-13 02:26:34,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14298 conditions, 1207 events. 364/1207 cut-off events. For 68561/69026 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10462 event pairs, 66 based on Foata normal form. 27/1176 useless extension candidates. Maximal degree in co-relation 14001. Up to 442 conditions per place. [2022-12-13 02:26:34,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 301 transitions, 8685 flow [2022-12-13 02:26:34,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 918 [2022-12-13 02:26:34,740 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:34,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 02:26:34,740 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 301 transitions, 8685 flow [2022-12-13 02:26:34,741 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-13 02:26:34,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:34,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:34,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 02:26:34,741 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-13 02:26:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1996289839, now seen corresponding path program 1 times [2022-12-13 02:26:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:34,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129318001] [2022-12-13 02:26:34,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:36,176 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-13 02:26:36,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:36,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129318001] [2022-12-13 02:26:36,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129318001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:36,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938665881] [2022-12-13 02:26:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:36,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:36,178 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-13 02:26:36,179 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-13 02:26:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:36,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:26:36,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:36,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:36,329 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-13 02:26:36,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:36,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 02:26:36,489 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-13 02:26:36,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:36,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:36,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 02:26:36,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:36,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 02:26:44,449 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-13 02:26:44,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938665881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:44,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:44,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 02:26:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841001748] [2022-12-13 02:26:44,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:44,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:26:44,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:44,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:26:44,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:26:44,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-13 02:26:44,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 301 transitions, 8685 flow. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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-13 02:26:44,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:44,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-13 02:26:44,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:46,451 INFO L130 PetriNetUnfolder]: 1802/3412 cut-off events. [2022-12-13 02:26:46,452 INFO L131 PetriNetUnfolder]: For 180923/180923 co-relation queries the response was YES. [2022-12-13 02:26:46,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41282 conditions, 3412 events. 1802/3412 cut-off events. For 180923/180923 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 23536 event pairs, 559 based on Foata normal form. 2/3404 useless extension candidates. Maximal degree in co-relation 40631. Up to 3023 conditions per place. [2022-12-13 02:26:46,492 INFO L137 encePairwiseOnDemand]: 32/69 looper letters, 256 selfloop transitions, 94 changer transitions 5/355 dead transitions. [2022-12-13 02:26:46,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 355 transitions, 10357 flow [2022-12-13 02:26:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:26:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:26:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2022-12-13 02:26:46,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17391304347826086 [2022-12-13 02:26:46,495 INFO L175 Difference]: Start difference. First operand has 225 places, 301 transitions, 8685 flow. Second operand 11 states and 132 transitions. [2022-12-13 02:26:46,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 355 transitions, 10357 flow [2022-12-13 02:26:46,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 355 transitions, 10281 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:46,996 INFO L231 Difference]: Finished difference. Result has 237 places, 319 transitions, 9450 flow [2022-12-13 02:26:46,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=8611, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9450, PETRI_PLACES=237, PETRI_TRANSITIONS=319} [2022-12-13 02:26:46,996 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 216 predicate places. [2022-12-13 02:26:46,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:46,997 INFO L89 Accepts]: Start accepts. Operand has 237 places, 319 transitions, 9450 flow [2022-12-13 02:26:46,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:46,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:46,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 319 transitions, 9450 flow [2022-12-13 02:26:47,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 319 transitions, 9450 flow [2022-12-13 02:26:47,196 INFO L130 PetriNetUnfolder]: 388/1286 cut-off events. [2022-12-13 02:26:47,196 INFO L131 PetriNetUnfolder]: For 76635/77137 co-relation queries the response was YES. [2022-12-13 02:26:47,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15633 conditions, 1286 events. 388/1286 cut-off events. For 76635/77137 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11313 event pairs, 71 based on Foata normal form. 27/1252 useless extension candidates. Maximal degree in co-relation 15332. Up to 481 conditions per place. [2022-12-13 02:26:47,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 319 transitions, 9450 flow [2022-12-13 02:26:47,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 986 [2022-12-13 02:26:47,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [680] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_324| v_~f~0.base_220))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_220 (* v_~x2~0_315 4)))) (.cse0 (* 2 (mod v_~n~0_223 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196| 0)) (= (ite (and (< v_~x1~0_374 v_~size~0_224) (<= 0 v_~x1~0_374)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_331| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_220 (* .cse2 4))) v_~x2~0_314) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (and (< .cse2 v_~size~0_224) (<= 0 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_266|) |v_thread2Thread1of1ForFork1_~i~1#1_265|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_266| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_330| (+ |v_thread1Thread1of1ForFork0_~i~0#1_331| 1)) (= (select .cse1 (+ v_~f~0.offset_220 (* v_~x1~0_374 4))) v_~x1~0_373) (not (= (ite (and (<= 0 v_~x2~0_315) (< v_~x2~0_315 v_~size~0_224)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_315, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_220, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_331|, #memory_int=|v_#memory_int_324|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_266|, ~n~0=v_~n~0_223, ~x1~0=v_~x1~0_374, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_314, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_162|, 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_265|, ~x1~0=v_~x1~0_373, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_330|, #memory_int=|v_#memory_int_324|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_148|, ~n~0=v_~n~0_223, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_148|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_216|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:26:47,498 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:47,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 503 [2022-12-13 02:26:47,499 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 319 transitions, 9516 flow [2022-12-13 02:26:47,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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-13 02:26:47,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:47,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:47,506 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-13 02:26:47,703 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,SelfDestructingSolverStorable39 [2022-12-13 02:26:47,703 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-13 02:26:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1321212823, now seen corresponding path program 1 times [2022-12-13 02:26:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:47,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261929086] [2022-12-13 02:26:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:48,370 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-13 02:26:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261929086] [2022-12-13 02:26:48,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261929086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694806454] [2022-12-13 02:26:48,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:48,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:48,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:48,376 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-13 02:26:48,378 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-13 02:26:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:48,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:26:48,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:48,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:48,558 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-13 02:26:48,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:48,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 02:26:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:26:48,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:26:48,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694806454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:48,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:26:48,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-13 02:26:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411408480] [2022-12-13 02:26:48,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:48,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:48,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:48,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:26:48,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 02:26:48,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 319 transitions, 9516 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:48,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:48,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 02:26:48,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:49,624 INFO L130 PetriNetUnfolder]: 1845/3503 cut-off events. [2022-12-13 02:26:49,624 INFO L131 PetriNetUnfolder]: For 190185/190185 co-relation queries the response was YES. [2022-12-13 02:26:49,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42861 conditions, 3503 events. 1845/3503 cut-off events. For 190185/190185 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24228 event pairs, 514 based on Foata normal form. 3/3496 useless extension candidates. Maximal degree in co-relation 42206. Up to 3059 conditions per place. [2022-12-13 02:26:49,663 INFO L137 encePairwiseOnDemand]: 29/70 looper letters, 237 selfloop transitions, 100 changer transitions 7/344 dead transitions. [2022-12-13 02:26:49,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 344 transitions, 10626 flow [2022-12-13 02:26:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 02:26:49,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26571428571428574 [2022-12-13 02:26:49,664 INFO L175 Difference]: Start difference. First operand has 237 places, 319 transitions, 9516 flow. Second operand 5 states and 93 transitions. [2022-12-13 02:26:49,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 344 transitions, 10626 flow [2022-12-13 02:26:50,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 344 transitions, 10291 flow, removed 139 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:50,275 INFO L231 Difference]: Finished difference. Result has 239 places, 327 transitions, 9727 flow [2022-12-13 02:26:50,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=9183, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9727, PETRI_PLACES=239, PETRI_TRANSITIONS=327} [2022-12-13 02:26:50,276 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 218 predicate places. [2022-12-13 02:26:50,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:50,276 INFO L89 Accepts]: Start accepts. Operand has 239 places, 327 transitions, 9727 flow [2022-12-13 02:26:50,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:50,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:50,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 327 transitions, 9727 flow [2022-12-13 02:26:50,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 327 transitions, 9727 flow [2022-12-13 02:26:50,478 INFO L130 PetriNetUnfolder]: 397/1317 cut-off events. [2022-12-13 02:26:50,479 INFO L131 PetriNetUnfolder]: For 79339/79919 co-relation queries the response was YES. [2022-12-13 02:26:50,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15926 conditions, 1317 events. 397/1317 cut-off events. For 79339/79919 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 11596 event pairs, 70 based on Foata normal form. 44/1295 useless extension candidates. Maximal degree in co-relation 15620. Up to 490 conditions per place. [2022-12-13 02:26:50,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 327 transitions, 9727 flow [2022-12-13 02:26:50,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 1014 [2022-12-13 02:26:50,504 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:50,504 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-13 02:26:50,504 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 327 transitions, 9727 flow [2022-12-13 02:26:50,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:50,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:50,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:50,511 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-13 02:26:50,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:50,705 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-13 02:26:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash -86933924, now seen corresponding path program 1 times [2022-12-13 02:26:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:50,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102861988] [2022-12-13 02:26:50,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:50,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102861988] [2022-12-13 02:26:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102861988] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149650985] [2022-12-13 02:26:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:51,872 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-13 02:26:51,876 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-13 02:26:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:52,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 02:26:52,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:52,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:52,034 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-13 02:26:52,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:52,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 02:26:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:52,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:52,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:52,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 02:26:52,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:52,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 02:26:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:59,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149650985] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:59,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:59,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 02:26:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577430486] [2022-12-13 02:26:59,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:59,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:26:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:26:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:26:59,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 02:26:59,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 327 transitions, 9727 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-13 02:26:59,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:59,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 02:26:59,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:01,533 INFO L130 PetriNetUnfolder]: 1888/3572 cut-off events. [2022-12-13 02:27:01,533 INFO L131 PetriNetUnfolder]: For 192377/192377 co-relation queries the response was YES. [2022-12-13 02:27:01,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43520 conditions, 3572 events. 1888/3572 cut-off events. For 192377/192377 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24750 event pairs, 489 based on Foata normal form. 1/3563 useless extension candidates. Maximal degree in co-relation 42776. Up to 2874 conditions per place. [2022-12-13 02:27:01,682 INFO L137 encePairwiseOnDemand]: 25/70 looper letters, 256 selfloop transitions, 132 changer transitions 29/417 dead transitions. [2022-12-13 02:27:01,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 417 transitions, 11787 flow [2022-12-13 02:27:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 02:27:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 02:27:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 190 transitions. [2022-12-13 02:27:01,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15079365079365079 [2022-12-13 02:27:01,683 INFO L175 Difference]: Start difference. First operand has 239 places, 327 transitions, 9727 flow. Second operand 18 states and 190 transitions. [2022-12-13 02:27:01,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 417 transitions, 11787 flow [2022-12-13 02:27:02,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 417 transitions, 11672 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 02:27:02,269 INFO L231 Difference]: Finished difference. Result has 255 places, 342 transitions, 10350 flow [2022-12-13 02:27:02,269 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=9614, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10350, PETRI_PLACES=255, PETRI_TRANSITIONS=342} [2022-12-13 02:27:02,269 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2022-12-13 02:27:02,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:02,270 INFO L89 Accepts]: Start accepts. Operand has 255 places, 342 transitions, 10350 flow [2022-12-13 02:27:02,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:02,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:02,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 342 transitions, 10350 flow [2022-12-13 02:27:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 342 transitions, 10350 flow [2022-12-13 02:27:02,485 INFO L130 PetriNetUnfolder]: 406/1343 cut-off events. [2022-12-13 02:27:02,485 INFO L131 PetriNetUnfolder]: For 82695/83276 co-relation queries the response was YES. [2022-12-13 02:27:02,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16507 conditions, 1343 events. 406/1343 cut-off events. For 82695/83276 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 11880 event pairs, 71 based on Foata normal form. 39/1316 useless extension candidates. Maximal degree in co-relation 16169. Up to 505 conditions per place. [2022-12-13 02:27:02,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 342 transitions, 10350 flow [2022-12-13 02:27:02,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 1060 [2022-12-13 02:27:03,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L49-2-->L49-2: Formula: (let ((.cse5 (select |v_#memory_int_290| v_~f~0.base_190))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_190 (* v_~x2~0_244 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_190 (* 4 .cse2)))) (.cse1 (select .cse5 (+ v_~f~0.offset_190 (* v_~x1~0_309 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_190 (* .cse1 4)))) (.cse4 (select .cse5 (+ v_~f~0.offset_190 (* 4 .cse3)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967295) 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_194) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_244) (< v_~x2~0_244 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_194)) 1 0) 0)) (= (ite (and (< .cse4 v_~size~0_194) (<= 0 .cse4)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_259| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|) (not (= (ite (and (< v_~x1~0_309 v_~size~0_194) (<= 0 v_~x1~0_309)) 1 0) 0)) (= v_~x1~0_307 (select .cse5 (+ v_~f~0.offset_190 (* .cse6 4)))) (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147|) (= |v_thread2Thread1of1ForFork1_~i~1#1_202| (+ |v_thread2Thread1of1ForFork1_~i~1#1_203| 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_202|) 4294967296) .cse0) (= (select .cse5 (+ v_~f~0.offset_190 (* .cse4 4))) v_~x2~0_243) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_203| 4294967296) .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_259| 3) |v_thread1Thread1of1ForFork0_~i~0#1_257|)))))) InVars {~x2~0=v_~x2~0_244, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_190, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_259|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_203|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_309, ~f~0.offset=v_~f~0.offset_190} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_165|, ~x2~0=v_~x2~0_243, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_111|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_190, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_115|, 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_202|, ~x1~0=v_~x1~0_307, ~f~0.offset=v_~f~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_101|, ~n~0=v_~n~0_193, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_173|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_101|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:27:04,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:27:04,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2134 [2022-12-13 02:27:04,404 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 342 transitions, 10460 flow [2022-12-13 02:27:04,404 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-13 02:27:04,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:04,405 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:04,415 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-13 02:27:04,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:04,610 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-13 02:27:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash 222025250, now seen corresponding path program 1 times [2022-12-13 02:27:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:04,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782103733] [2022-12-13 02:27:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:04,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:27:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:04,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782103733] [2022-12-13 02:27:04,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782103733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:27:04,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:27:04,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:27:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810683135] [2022-12-13 02:27:04,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:27:04,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:27:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:27:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:27:04,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 02:27:04,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 342 transitions, 10460 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:04,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:04,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 02:27:04,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:05,701 INFO L130 PetriNetUnfolder]: 1855/3507 cut-off events. [2022-12-13 02:27:05,701 INFO L131 PetriNetUnfolder]: For 197710/197710 co-relation queries the response was YES. [2022-12-13 02:27:05,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43466 conditions, 3507 events. 1855/3507 cut-off events. For 197710/197710 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24151 event pairs, 667 based on Foata normal form. 36/3533 useless extension candidates. Maximal degree in co-relation 42066. Up to 2711 conditions per place. [2022-12-13 02:27:05,742 INFO L137 encePairwiseOnDemand]: 32/72 looper letters, 249 selfloop transitions, 119 changer transitions 2/370 dead transitions. [2022-12-13 02:27:05,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 370 transitions, 11673 flow [2022-12-13 02:27:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:27:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:27:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 02:27:05,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2022-12-13 02:27:05,743 INFO L175 Difference]: Start difference. First operand has 255 places, 342 transitions, 10460 flow. Second operand 5 states and 104 transitions. [2022-12-13 02:27:05,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 370 transitions, 11673 flow [2022-12-13 02:27:06,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 370 transitions, 11298 flow, removed 95 selfloop flow, removed 6 redundant places. [2022-12-13 02:27:06,349 INFO L231 Difference]: Finished difference. Result has 254 places, 342 transitions, 10317 flow [2022-12-13 02:27:06,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=10085, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10317, PETRI_PLACES=254, PETRI_TRANSITIONS=342} [2022-12-13 02:27:06,349 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 233 predicate places. [2022-12-13 02:27:06,349 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:06,350 INFO L89 Accepts]: Start accepts. Operand has 254 places, 342 transitions, 10317 flow [2022-12-13 02:27:06,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:06,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:06,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 342 transitions, 10317 flow [2022-12-13 02:27:06,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 342 transitions, 10317 flow [2022-12-13 02:27:06,544 INFO L130 PetriNetUnfolder]: 402/1320 cut-off events. [2022-12-13 02:27:06,544 INFO L131 PetriNetUnfolder]: For 82007/82508 co-relation queries the response was YES. [2022-12-13 02:27:06,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16358 conditions, 1320 events. 402/1320 cut-off events. For 82007/82508 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11619 event pairs, 69 based on Foata normal form. 39/1301 useless extension candidates. Maximal degree in co-relation 15782. Up to 493 conditions per place. [2022-12-13 02:27:06,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 342 transitions, 10317 flow [2022-12-13 02:27:06,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 1062 [2022-12-13 02:27:06,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [665] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_297| v_~f~0.base_196))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_196 (* v_~x2~0_263 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_196 (* .cse6 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_196 (* .cse5 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_196 (* .cse3 4)))) (.cse8 (select .cse0 (+ v_~f~0.offset_196 (* v_~x1~0_327 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_196 (* 4 .cse8)))) (.cse2 (* (mod v_~n~0_199 2147483648) 2)) (.cse4 (select .cse0 (+ v_~f~0.offset_196 (* .cse7 4))))) (and (= (select .cse0 (+ v_~f~0.offset_196 (* .cse1 4))) v_~x1~0_325) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_222|) 4294967296) .cse2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_278| 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_200)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175|) (not (= (ite (and (<= 0 v_~x1~0_327) (< v_~x1~0_327 v_~size~0_200)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_196 (* .cse4 4))) v_~x2~0_262) (= (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_223|) |v_thread2Thread1of1ForFork1_~i~1#1_222|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_200)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_200)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_276| 4294967295) 4294967296) .cse2) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_278| 3) |v_thread1Thread1of1ForFork0_~i~0#1_276|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_200)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_222|) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_200)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175| 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_263) (< v_~x2~0_263 v_~size~0_200)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_223| 4294967296) .cse2) (not (= (ite (and (< .cse8 v_~size~0_200) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_200)) 1 0))))))))) InVars {~x2~0=v_~x2~0_263, ~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_196, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_278|, #memory_int=|v_#memory_int_297|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_223|, ~n~0=v_~n~0_199, ~x1~0=v_~x1~0_327, ~f~0.offset=v_~f~0.offset_196} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_177|, ~x2~0=v_~x2~0_262, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_125|, ~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_196, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_222|, ~x1~0=v_~x1~0_325, ~f~0.offset=v_~f~0.offset_196, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175|, #memory_int=|v_#memory_int_297|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_115|, ~n~0=v_~n~0_199, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_185|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_115|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:27:08,368 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:27:08,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2020 [2022-12-13 02:27:08,369 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 342 transitions, 10377 flow [2022-12-13 02:27:08,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:08,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:08,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:08,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 02:27:08,370 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-13 02:27:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1569789508, now seen corresponding path program 1 times [2022-12-13 02:27:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:08,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16600140] [2022-12-13 02:27:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:17,569 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-13 02:27:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:17,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16600140] [2022-12-13 02:27:17,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16600140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:17,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336927638] [2022-12-13 02:27:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:17,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:17,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:17,571 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-13 02:27:17,572 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-13 02:27:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:17,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 02:27:17,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:17,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:27:17,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 02:27:17,822 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-13 02:27:17,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:18,185 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-13 02:27:18,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-13 02:27:19,206 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-13 02:27:19,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336927638] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:19,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:19,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-13 02:27:19,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746460326] [2022-12-13 02:27:19,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:19,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:27:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:19,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:27:19,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:27:19,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 02:27:19,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 342 transitions, 10377 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-13 02:27:19,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:19,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 02:27:19,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:21,279 INFO L130 PetriNetUnfolder]: 1921/3612 cut-off events. [2022-12-13 02:27:21,279 INFO L131 PetriNetUnfolder]: For 206084/206084 co-relation queries the response was YES. [2022-12-13 02:27:21,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45230 conditions, 3612 events. 1921/3612 cut-off events. For 206084/206084 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 24908 event pairs, 750 based on Foata normal form. 1/3603 useless extension candidates. Maximal degree in co-relation 44648. Up to 2946 conditions per place. [2022-12-13 02:27:21,324 INFO L137 encePairwiseOnDemand]: 27/72 looper letters, 268 selfloop transitions, 140 changer transitions 7/415 dead transitions. [2022-12-13 02:27:21,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 415 transitions, 12367 flow [2022-12-13 02:27:21,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:27:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:27:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2022-12-13 02:27:21,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19065656565656566 [2022-12-13 02:27:21,326 INFO L175 Difference]: Start difference. First operand has 252 places, 342 transitions, 10377 flow. Second operand 11 states and 151 transitions. [2022-12-13 02:27:21,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 415 transitions, 12367 flow [2022-12-13 02:27:21,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 415 transitions, 12101 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 02:27:21,998 INFO L231 Difference]: Finished difference. Result has 261 places, 369 transitions, 11206 flow [2022-12-13 02:27:21,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=10111, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11206, PETRI_PLACES=261, PETRI_TRANSITIONS=369} [2022-12-13 02:27:21,999 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2022-12-13 02:27:21,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:21,999 INFO L89 Accepts]: Start accepts. Operand has 261 places, 369 transitions, 11206 flow [2022-12-13 02:27:22,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:22,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:22,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 369 transitions, 11206 flow [2022-12-13 02:27:22,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 369 transitions, 11206 flow [2022-12-13 02:27:22,243 INFO L130 PetriNetUnfolder]: 416/1360 cut-off events. [2022-12-13 02:27:22,243 INFO L131 PetriNetUnfolder]: For 85994/86500 co-relation queries the response was YES. [2022-12-13 02:27:22,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17106 conditions, 1360 events. 416/1360 cut-off events. For 85994/86500 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11958 event pairs, 69 based on Foata normal form. 51/1354 useless extension candidates. Maximal degree in co-relation 16831. Up to 511 conditions per place. [2022-12-13 02:27:22,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 369 transitions, 11206 flow [2022-12-13 02:27:22,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 1144 [2022-12-13 02:27:22,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [684] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~f~0.base_226))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_226 (* v_~x2~0_325 4))))) (and (= v_~x2~0_324 (select .cse0 (+ v_~f~0.offset_226 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (= (select .cse0 (+ v_~f~0.offset_226 (* v_~x1~0_382 4))) v_~x1~0_381) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_339| 4294967296) (* (mod v_~n~0_229 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_275|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| (ite (and (<= 0 v_~x1~0_382) (< v_~x1~0_382 v_~size~0_230)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_230)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_338| (+ |v_thread1Thread1of1ForFork0_~i~0#1_339| 1)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_230) (<= 0 v_~x2~0_325)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_339|, #memory_int=|v_#memory_int_330|, ~n~0=v_~n~0_229, ~x1~0=v_~x1~0_382, ~f~0.offset=v_~f~0.offset_226} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_168|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_275|, ~x1~0=v_~x1~0_381, ~f~0.offset=v_~f~0.offset_226, 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_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, #memory_int=|v_#memory_int_330|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_154|, ~n~0=v_~n~0_229, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_154|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:27:22,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 02:27:22,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [683] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_328| v_~f~0.base_224))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_224 (* v_~x2~0_320 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_224 (* .cse3 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_224 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_228) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_224 (* .cse2 4))) v_~x2~0_318) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_228)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_228)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|) (= |v_thread2Thread1of1ForFork1_~i~1#1_271| 4) (not (= (ite (and (< v_~x2~0_320 v_~size~0_228) (<= 0 v_~x2~0_320)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198| 0)) (< 2 (* 2 (mod v_~n~0_227 2147483648)))))))) InVars {~x2~0=v_~x2~0_320, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, #memory_int=|v_#memory_int_328|, ~n~0=v_~n~0_227, ~f~0.offset=v_~f~0.offset_224} OutVars{~x2~0=v_~x2~0_318, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_160|, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_164|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_271|, ~f~0.offset=v_~f~0.offset_224, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|, #memory_int=|v_#memory_int_328|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_150|, ~n~0=v_~n~0_227, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_150|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:27:23,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:27:23,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1151 [2022-12-13 02:27:23,150 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 368 transitions, 11309 flow [2022-12-13 02:27:23,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-13 02:27:23,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:23,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:23,155 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-13 02:27:23,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:23,352 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-13 02:27:23,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -269588529, now seen corresponding path program 1 times [2022-12-13 02:27:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:23,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658560617] [2022-12-13 02:27:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:23,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:33,506 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-13 02:34:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:34:33,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658560617] [2022-12-13 02:34:33,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658560617] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:34:33,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280842642] [2022-12-13 02:34:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:34:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:34:33,519 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-13 02:34:33,520 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-13 02:34:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:33,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 02:34:33,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:34:33,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:33,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 76 [2022-12-13 02:34:33,761 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-13 02:34:33,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:34:34,142 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-13 02:34:34,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-13 02:34:35,062 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-13 02:34:35,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280842642] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:34:35,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:34:35,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 02:34:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676965078] [2022-12-13 02:34:35,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:34:35,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:34:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:34:35,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:34:35,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:34:35,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 02:34:35,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 368 transitions, 11309 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:35,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:34:35,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 02:34:35,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:34:36,395 INFO L130 PetriNetUnfolder]: 1941/3645 cut-off events. [2022-12-13 02:34:36,396 INFO L131 PetriNetUnfolder]: For 216598/216598 co-relation queries the response was YES. [2022-12-13 02:34:36,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46345 conditions, 3645 events. 1941/3645 cut-off events. For 216598/216598 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25222 event pairs, 877 based on Foata normal form. 1/3636 useless extension candidates. Maximal degree in co-relation 45639. Up to 3475 conditions per place. [2022-12-13 02:34:36,438 INFO L137 encePairwiseOnDemand]: 41/76 looper letters, 318 selfloop transitions, 70 changer transitions 1/389 dead transitions. [2022-12-13 02:34:36,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 389 transitions, 12439 flow [2022-12-13 02:34:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:34:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:34:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-13 02:34:36,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20676691729323307 [2022-12-13 02:34:36,439 INFO L175 Difference]: Start difference. First operand has 260 places, 368 transitions, 11309 flow. Second operand 7 states and 110 transitions. [2022-12-13 02:34:36,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 389 transitions, 12439 flow [2022-12-13 02:34:37,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 389 transitions, 12093 flow, removed 130 selfloop flow, removed 3 redundant places. [2022-12-13 02:34:37,229 INFO L231 Difference]: Finished difference. Result has 265 places, 373 transitions, 11356 flow [2022-12-13 02:34:37,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=10963, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11356, PETRI_PLACES=265, PETRI_TRANSITIONS=373} [2022-12-13 02:34:37,229 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 244 predicate places. [2022-12-13 02:34:37,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:34:37,229 INFO L89 Accepts]: Start accepts. Operand has 265 places, 373 transitions, 11356 flow [2022-12-13 02:34:37,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:34:37,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:34:37,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 373 transitions, 11356 flow [2022-12-13 02:34:37,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 373 transitions, 11356 flow [2022-12-13 02:34:37,456 INFO L130 PetriNetUnfolder]: 423/1377 cut-off events. [2022-12-13 02:34:37,456 INFO L131 PetriNetUnfolder]: For 89392/89936 co-relation queries the response was YES. [2022-12-13 02:34:37,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17345 conditions, 1377 events. 423/1377 cut-off events. For 89392/89936 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 12144 event pairs, 68 based on Foata normal form. 41/1359 useless extension candidates. Maximal degree in co-relation 17019. Up to 516 conditions per place. [2022-12-13 02:34:37,479 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 373 transitions, 11356 flow [2022-12-13 02:34:37,479 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 02:34:37,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_356| v_~f~0.base_244))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_244 (* v_~x2~0_364 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_244 (* .cse5 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_244 (* v_~x1~0_445 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_244 (* .cse2 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_244 (* .cse4 4))))) (and (= (select .cse0 (+ v_~f~0.offset_244 (* 4 .cse1))) v_~x2~0_363) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_248)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_226| 0)) (= (select .cse0 (+ v_~f~0.offset_244 (* .cse3 4))) v_~x1~0_444) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249| 0)) (not (= (ite (and (< .cse4 v_~size~0_248) (<= 0 .cse4)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_445) (< v_~x1~0_445 v_~size~0_248)) 1 0))) (= |v_thread2Thread1of1ForFork1_~i~1#1_309| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233| (ite (and (< .cse3 v_~size~0_248) (<= 0 .cse3)) 1 0)) (< 2 (* (mod v_~n~0_247 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_226|) (not (= (ite (and (< .cse5 v_~size~0_248) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_364 v_~size~0_248) (<= 0 v_~x2~0_364)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|) (= |v_thread1Thread1of1ForFork0_~i~0#1_389| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_248)) 1 0))))))) InVars {~x2~0=v_~x2~0_364, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_244, #memory_int=|v_#memory_int_356|, ~n~0=v_~n~0_247, ~x1~0=v_~x1~0_445, ~f~0.offset=v_~f~0.offset_244} OutVars{~x2~0=v_~x2~0_363, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_251|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_188|, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_244, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_192|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_309|, ~x1~0=v_~x1~0_444, ~f~0.offset=v_~f~0.offset_244, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_226|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_389|, #memory_int=|v_#memory_int_356|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_178|, ~n~0=v_~n~0_247, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_178|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_259|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:34:38,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:34:38,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1115 [2022-12-13 02:34:38,345 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 373 transitions, 11432 flow [2022-12-13 02:34:38,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:38,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:34:38,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:34:38,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 02:34:38,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:34:38,554 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-13 02:34:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:34:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1007178372, now seen corresponding path program 1 times [2022-12-13 02:34:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:34:38,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565950794] [2022-12-13 02:34:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:34:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:40,022 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-13 02:34:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:34:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565950794] [2022-12-13 02:34:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565950794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:34:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353406443] [2022-12-13 02:34:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:34:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:34:40,024 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-13 02:34:40,029 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-13 02:34:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:40,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 02:34:40,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:34:40,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:34:40,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 02:34:40,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:40,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 02:34:40,305 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-13 02:34:40,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:34:40,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:40,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 02:34:40,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:40,575 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-13 02:34:44,108 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-13 02:34:44,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353406443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:34:44,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:34:44,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:34:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563170166] [2022-12-13 02:34:44,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:34:44,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:34:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:34:44,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:34:44,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:34:44,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 02:34:44,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 373 transitions, 11432 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-13 02:34:44,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:34:44,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 02:34:44,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:34:45,920 INFO L130 PetriNetUnfolder]: 1985/3727 cut-off events. [2022-12-13 02:34:45,921 INFO L131 PetriNetUnfolder]: For 225783/225783 co-relation queries the response was YES. [2022-12-13 02:34:45,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47404 conditions, 3727 events. 1985/3727 cut-off events. For 225783/225783 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 25845 event pairs, 485 based on Foata normal form. 1/3718 useless extension candidates. Maximal degree in co-relation 46829. Up to 2960 conditions per place. [2022-12-13 02:34:45,961 INFO L137 encePairwiseOnDemand]: 26/78 looper letters, 267 selfloop transitions, 156 changer transitions 8/431 dead transitions. [2022-12-13 02:34:45,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 431 transitions, 13226 flow [2022-12-13 02:34:45,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:34:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:34:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2022-12-13 02:34:45,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2022-12-13 02:34:45,962 INFO L175 Difference]: Start difference. First operand has 265 places, 373 transitions, 11432 flow. Second operand 11 states and 156 transitions. [2022-12-13 02:34:45,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 431 transitions, 13226 flow [2022-12-13 02:34:46,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 431 transitions, 13110 flow, removed 52 selfloop flow, removed 1 redundant places. [2022-12-13 02:34:46,751 INFO L231 Difference]: Finished difference. Result has 278 places, 385 transitions, 12169 flow [2022-12-13 02:34:46,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=11326, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12169, PETRI_PLACES=278, PETRI_TRANSITIONS=385} [2022-12-13 02:34:46,751 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 257 predicate places. [2022-12-13 02:34:46,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:34:46,752 INFO L89 Accepts]: Start accepts. Operand has 278 places, 385 transitions, 12169 flow [2022-12-13 02:34:46,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:34:46,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:34:46,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 385 transitions, 12169 flow [2022-12-13 02:34:46,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 385 transitions, 12169 flow [2022-12-13 02:34:46,986 INFO L130 PetriNetUnfolder]: 433/1415 cut-off events. [2022-12-13 02:34:46,986 INFO L131 PetriNetUnfolder]: For 95531/96055 co-relation queries the response was YES. [2022-12-13 02:34:46,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18145 conditions, 1415 events. 433/1415 cut-off events. For 95531/96055 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 12558 event pairs, 67 based on Foata normal form. 35/1391 useless extension candidates. Maximal degree in co-relation 17863. Up to 527 conditions per place. [2022-12-13 02:34:47,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 385 transitions, 12169 flow [2022-12-13 02:34:47,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-13 02:34:47,010 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:34:47,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-13 02:34:47,011 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 385 transitions, 12169 flow [2022-12-13 02:34:47,011 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-13 02:34:47,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:34:47,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:34:47,016 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-13 02:34:47,211 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,SelfDestructingSolverStorable45 [2022-12-13 02:34:47,211 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-13 02:34:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:34:47,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1557141805, now seen corresponding path program 1 times [2022-12-13 02:34:47,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:34:47,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639542988] [2022-12-13 02:34:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:47,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:34:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:12,987 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-13 02:35:12,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639542988] [2022-12-13 02:35:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639542988] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688557100] [2022-12-13 02:35:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:12,989 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-13 02:35:12,990 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-13 02:35:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:13,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 02:35:13,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:13,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:13,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 02:35:13,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:13,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 76 [2022-12-13 02:35:13,222 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-13 02:35:13,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:13,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:13,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 02:35:13,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:13,483 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 45 treesize of output 152 [2022-12-13 02:35:15,920 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-13 02:35:15,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688557100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:15,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:35:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596661576] [2022-12-13 02:35:15,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:35:15,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:35:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:35:15,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 02:35:15,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 385 transitions, 12169 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-13 02:35:15,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:15,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 02:35:15,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:17,490 INFO L130 PetriNetUnfolder]: 2041/3824 cut-off events. [2022-12-13 02:35:17,490 INFO L131 PetriNetUnfolder]: For 237311/237311 co-relation queries the response was YES. [2022-12-13 02:35:17,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49707 conditions, 3824 events. 2041/3824 cut-off events. For 237311/237311 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 26813 event pairs, 639 based on Foata normal form. 1/3815 useless extension candidates. Maximal degree in co-relation 48710. Up to 3546 conditions per place. [2022-12-13 02:35:17,534 INFO L137 encePairwiseOnDemand]: 35/78 looper letters, 325 selfloop transitions, 101 changer transitions 2/428 dead transitions. [2022-12-13 02:35:17,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 428 transitions, 13877 flow [2022-12-13 02:35:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:35:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:35:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-12-13 02:35:17,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17051282051282052 [2022-12-13 02:35:17,535 INFO L175 Difference]: Start difference. First operand has 278 places, 385 transitions, 12169 flow. Second operand 10 states and 133 transitions. [2022-12-13 02:35:17,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 428 transitions, 13877 flow [2022-12-13 02:35:18,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 428 transitions, 13731 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-13 02:35:18,284 INFO L231 Difference]: Finished difference. Result has 287 places, 402 transitions, 12904 flow [2022-12-13 02:35:18,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=12027, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12904, PETRI_PLACES=287, PETRI_TRANSITIONS=402} [2022-12-13 02:35:18,285 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 266 predicate places. [2022-12-13 02:35:18,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:18,285 INFO L89 Accepts]: Start accepts. Operand has 287 places, 402 transitions, 12904 flow [2022-12-13 02:35:18,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:18,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:18,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 402 transitions, 12904 flow [2022-12-13 02:35:18,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 402 transitions, 12904 flow [2022-12-13 02:35:18,602 INFO L130 PetriNetUnfolder]: 444/1438 cut-off events. [2022-12-13 02:35:18,602 INFO L131 PetriNetUnfolder]: For 98277/98799 co-relation queries the response was YES. [2022-12-13 02:35:18,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18833 conditions, 1438 events. 444/1438 cut-off events. For 98277/98799 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12839 event pairs, 74 based on Foata normal form. 36/1414 useless extension candidates. Maximal degree in co-relation 18390. Up to 548 conditions per place. [2022-12-13 02:35:18,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 402 transitions, 12904 flow [2022-12-13 02:35:18,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 1250 [2022-12-13 02:35:18,624 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:35:18,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 339 [2022-12-13 02:35:18,624 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 402 transitions, 12904 flow [2022-12-13 02:35:18,624 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-13 02:35:18,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:18,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:18,630 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-13 02:35:18,829 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,SelfDestructingSolverStorable46 [2022-12-13 02:35:18,829 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-13 02:35:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2085322227, now seen corresponding path program 1 times [2022-12-13 02:35:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:18,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431318108] [2022-12-13 02:35:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:18,899 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-13 02:35:18,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:18,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431318108] [2022-12-13 02:35:18,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431318108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:35:18,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:35:18,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:35:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660921363] [2022-12-13 02:35:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:35:18,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:35:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:35:18,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:35:18,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 02:35:18,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 402 transitions, 12904 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:18,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:18,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 02:35:18,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:20,016 INFO L130 PetriNetUnfolder]: 2071/3886 cut-off events. [2022-12-13 02:35:20,016 INFO L131 PetriNetUnfolder]: For 251339/251339 co-relation queries the response was YES. [2022-12-13 02:35:20,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51077 conditions, 3886 events. 2071/3886 cut-off events. For 251339/251339 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27258 event pairs, 923 based on Foata normal form. 8/3884 useless extension candidates. Maximal degree in co-relation 49919. Up to 3554 conditions per place. [2022-12-13 02:35:20,060 INFO L137 encePairwiseOnDemand]: 49/78 looper letters, 344 selfloop transitions, 81 changer transitions 1/426 dead transitions. [2022-12-13 02:35:20,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 426 transitions, 14247 flow [2022-12-13 02:35:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:35:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:35:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 02:35:20,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2717948717948718 [2022-12-13 02:35:20,061 INFO L175 Difference]: Start difference. First operand has 287 places, 402 transitions, 12904 flow. Second operand 5 states and 106 transitions. [2022-12-13 02:35:20,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 426 transitions, 14247 flow [2022-12-13 02:35:20,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 426 transitions, 13990 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-12-13 02:35:20,820 INFO L231 Difference]: Finished difference. Result has 288 places, 406 transitions, 12964 flow [2022-12-13 02:35:20,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=12651, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12964, PETRI_PLACES=288, PETRI_TRANSITIONS=406} [2022-12-13 02:35:20,821 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 267 predicate places. [2022-12-13 02:35:20,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:20,821 INFO L89 Accepts]: Start accepts. Operand has 288 places, 406 transitions, 12964 flow [2022-12-13 02:35:20,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:20,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:20,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 406 transitions, 12964 flow [2022-12-13 02:35:20,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 406 transitions, 12964 flow [2022-12-13 02:35:21,114 INFO L130 PetriNetUnfolder]: 450/1462 cut-off events. [2022-12-13 02:35:21,114 INFO L131 PetriNetUnfolder]: For 105362/105923 co-relation queries the response was YES. [2022-12-13 02:35:21,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19398 conditions, 1462 events. 450/1462 cut-off events. For 105362/105923 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13046 event pairs, 72 based on Foata normal form. 41/1441 useless extension candidates. Maximal degree in co-relation 18978. Up to 558 conditions per place. [2022-12-13 02:35:21,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 406 transitions, 12964 flow [2022-12-13 02:35:21,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 1262 [2022-12-13 02:35:21,137 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:35:21,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-13 02:35:21,138 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 406 transitions, 12964 flow [2022-12-13 02:35:21,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:21,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:21,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:21,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 02:35:21,138 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-13 02:35:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -595417083, now seen corresponding path program 1 times [2022-12-13 02:35:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:21,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630633675] [2022-12-13 02:35:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:21,196 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-13 02:35:21,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630633675] [2022-12-13 02:35:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630633675] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395956473] [2022-12-13 02:35:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:21,198 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-13 02:35:21,199 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-13 02:35:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:21,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:35:21,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:21,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-13 02:35:21,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:21,400 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-13 02:35:21,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395956473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:21,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:21,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 02:35:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023617131] [2022-12-13 02:35:21,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:21,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:35:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:35:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:35:21,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 02:35:21,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 406 transitions, 12964 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 02:35:21,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:21,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 02:35:21,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:22,882 INFO L130 PetriNetUnfolder]: 2125/4000 cut-off events. [2022-12-13 02:35:22,882 INFO L131 PetriNetUnfolder]: For 267122/267122 co-relation queries the response was YES. [2022-12-13 02:35:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53141 conditions, 4000 events. 2125/4000 cut-off events. For 267122/267122 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 28296 event pairs, 948 based on Foata normal form. 18/4008 useless extension candidates. Maximal degree in co-relation 52364. Up to 3712 conditions per place. [2022-12-13 02:35:22,928 INFO L137 encePairwiseOnDemand]: 58/78 looper letters, 393 selfloop transitions, 48 changer transitions 2/443 dead transitions. [2022-12-13 02:35:22,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 443 transitions, 14637 flow [2022-12-13 02:35:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:35:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:35:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-13 02:35:22,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 02:35:22,929 INFO L175 Difference]: Start difference. First operand has 288 places, 406 transitions, 12964 flow. Second operand 6 states and 117 transitions. [2022-12-13 02:35:22,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 443 transitions, 14637 flow [2022-12-13 02:35:23,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 443 transitions, 14495 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 02:35:23,677 INFO L231 Difference]: Finished difference. Result has 291 places, 412 transitions, 13203 flow [2022-12-13 02:35:23,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=12830, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13203, PETRI_PLACES=291, PETRI_TRANSITIONS=412} [2022-12-13 02:35:23,677 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 270 predicate places. [2022-12-13 02:35:23,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:23,677 INFO L89 Accepts]: Start accepts. Operand has 291 places, 412 transitions, 13203 flow [2022-12-13 02:35:23,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:23,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:23,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 412 transitions, 13203 flow [2022-12-13 02:35:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 412 transitions, 13203 flow [2022-12-13 02:35:23,916 INFO L130 PetriNetUnfolder]: 460/1514 cut-off events. [2022-12-13 02:35:23,916 INFO L131 PetriNetUnfolder]: For 109637/110193 co-relation queries the response was YES. [2022-12-13 02:35:23,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20249 conditions, 1514 events. 460/1514 cut-off events. For 109637/110193 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 13754 event pairs, 72 based on Foata normal form. 41/1493 useless extension candidates. Maximal degree in co-relation 19888. Up to 573 conditions per place. [2022-12-13 02:35:23,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 412 transitions, 13203 flow [2022-12-13 02:35:23,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 1300 [2022-12-13 02:35:23,947 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:35:23,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-13 02:35:23,947 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 412 transitions, 13203 flow [2022-12-13 02:35:23,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 02:35:23,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:23,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:23,954 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-13 02:35:24,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 02:35:24,154 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-13 02:35:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1404763709, now seen corresponding path program 1 times [2022-12-13 02:35:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:24,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781803913] [2022-12-13 02:35:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:24,305 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-13 02:35:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781803913] [2022-12-13 02:35:24,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781803913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204325010] [2022-12-13 02:35:24,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:24,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:24,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:24,307 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-13 02:35:24,308 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-13 02:35:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:24,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:35:24,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:24,501 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-13 02:35:24,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:24,523 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-13 02:35:24,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204325010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:24,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:24,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 02:35:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553756509] [2022-12-13 02:35:24,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:24,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:35:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:24,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:35:24,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:35:24,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 02:35:24,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 412 transitions, 13203 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-13 02:35:24,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:24,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 02:35:24,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:26,324 INFO L130 PetriNetUnfolder]: 2149/4040 cut-off events. [2022-12-13 02:35:26,325 INFO L131 PetriNetUnfolder]: For 282079/282079 co-relation queries the response was YES. [2022-12-13 02:35:26,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54746 conditions, 4040 events. 2149/4040 cut-off events. For 282079/282079 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 28619 event pairs, 1007 based on Foata normal form. 12/4042 useless extension candidates. Maximal degree in co-relation 53957. Up to 3902 conditions per place. [2022-12-13 02:35:26,371 INFO L137 encePairwiseOnDemand]: 62/78 looper letters, 393 selfloop transitions, 46 changer transitions 0/439 dead transitions. [2022-12-13 02:35:26,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 439 transitions, 14878 flow [2022-12-13 02:35:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:35:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:35:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-13 02:35:26,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17147435897435898 [2022-12-13 02:35:26,372 INFO L175 Difference]: Start difference. First operand has 291 places, 412 transitions, 13203 flow. Second operand 8 states and 107 transitions. [2022-12-13 02:35:26,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 439 transitions, 14878 flow [2022-12-13 02:35:27,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 439 transitions, 14780 flow, removed 49 selfloop flow, removed 0 redundant places. [2022-12-13 02:35:27,106 INFO L231 Difference]: Finished difference. Result has 302 places, 419 transitions, 13544 flow [2022-12-13 02:35:27,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=13105, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13544, PETRI_PLACES=302, PETRI_TRANSITIONS=419} [2022-12-13 02:35:27,106 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 281 predicate places. [2022-12-13 02:35:27,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:27,107 INFO L89 Accepts]: Start accepts. Operand has 302 places, 419 transitions, 13544 flow [2022-12-13 02:35:27,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:27,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:27,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 419 transitions, 13544 flow [2022-12-13 02:35:27,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 419 transitions, 13544 flow [2022-12-13 02:35:27,364 INFO L130 PetriNetUnfolder]: 465/1526 cut-off events. [2022-12-13 02:35:27,364 INFO L131 PetriNetUnfolder]: For 124257/124823 co-relation queries the response was YES. [2022-12-13 02:35:27,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21095 conditions, 1526 events. 465/1526 cut-off events. For 124257/124823 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13835 event pairs, 72 based on Foata normal form. 46/1512 useless extension candidates. Maximal degree in co-relation 20729. Up to 580 conditions per place. [2022-12-13 02:35:27,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 419 transitions, 13544 flow [2022-12-13 02:35:27,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 02:35:27,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_361| v_~f~0.base_248))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_248 (* v_~x2~0_375 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_248 (* .cse6 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_248 (* .cse2 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_248 (* 4 .cse7)))) (.cse5 (select .cse0 (+ (* v_~x1~0_459 4) v_~f~0.offset_248)))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_248 (* .cse5 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_248 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_232|) (= (select .cse0 (+ v_~f~0.offset_248 (* .cse1 4))) v_~x1~0_458) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_315|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_258| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_258|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_252)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_232| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_252)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_398| 3) (= (ite (and (< .cse1 v_~size~0_252) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|) (= v_~x2~0_373 (select .cse0 (+ v_~f~0.offset_248 (* .cse4 4)))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_252) (<= 0 .cse7)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_315|) 4294967296) (* 2 (mod v_~n~0_251 2147483648))) (not (= (ite (and (<= 0 v_~x1~0_459) (< v_~x1~0_459 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_375) (< v_~x2~0_375 v_~size~0_252)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (and (< .cse4 v_~size~0_252) (<= 0 .cse4)) 1 0))))))))) InVars {~x2~0=v_~x2~0_375, ~size~0=v_~size~0_252, ~f~0.base=v_~f~0.base_248, #memory_int=|v_#memory_int_361|, ~n~0=v_~n~0_251, ~x1~0=v_~x1~0_459, ~f~0.offset=v_~f~0.offset_248} OutVars{~x2~0=v_~x2~0_373, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_260|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_194|, ~size~0=v_~size~0_252, ~f~0.base=v_~f~0.base_248, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_198|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_315|, ~x1~0=v_~x1~0_458, ~f~0.offset=v_~f~0.offset_248, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_232|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_398|, #memory_int=|v_#memory_int_361|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_258|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_184|, ~n~0=v_~n~0_251, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_184|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_268|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:35:28,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:35:28,762 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:35:28,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1656 [2022-12-13 02:35:28,762 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 419 transitions, 13686 flow [2022-12-13 02:35:28,762 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-13 02:35:28,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:28,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:28,769 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-13 02:35:28,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:28,963 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-13 02:35:28,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1067515363, now seen corresponding path program 2 times [2022-12-13 02:35:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:28,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968564266] [2022-12-13 02:35:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:29,022 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-13 02:35:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:29,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968564266] [2022-12-13 02:35:29,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968564266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:35:29,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:35:29,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:35:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412326981] [2022-12-13 02:35:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:35:29,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:35:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:35:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:35:29,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-13 02:35:29,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 419 transitions, 13686 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:29,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:29,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-13 02:35:29,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:30,365 INFO L130 PetriNetUnfolder]: 2135/4008 cut-off events. [2022-12-13 02:35:30,365 INFO L131 PetriNetUnfolder]: For 304094/304094 co-relation queries the response was YES. [2022-12-13 02:35:30,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55590 conditions, 4008 events. 2135/4008 cut-off events. For 304094/304094 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 28266 event pairs, 1027 based on Foata normal form. 6/4004 useless extension candidates. Maximal degree in co-relation 54796. Up to 3988 conditions per place. [2022-12-13 02:35:30,410 INFO L137 encePairwiseOnDemand]: 77/82 looper letters, 417 selfloop transitions, 3 changer transitions 8/428 dead transitions. [2022-12-13 02:35:30,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 428 transitions, 14724 flow [2022-12-13 02:35:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:35:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:35:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 02:35:30,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2896341463414634 [2022-12-13 02:35:30,411 INFO L175 Difference]: Start difference. First operand has 302 places, 419 transitions, 13686 flow. Second operand 4 states and 95 transitions. [2022-12-13 02:35:30,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 428 transitions, 14724 flow [2022-12-13 02:35:31,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 428 transitions, 14395 flow, removed 144 selfloop flow, removed 1 redundant places. [2022-12-13 02:35:31,252 INFO L231 Difference]: Finished difference. Result has 305 places, 419 transitions, 13370 flow [2022-12-13 02:35:31,253 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=13357, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13370, PETRI_PLACES=305, PETRI_TRANSITIONS=419} [2022-12-13 02:35:31,253 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 284 predicate places. [2022-12-13 02:35:31,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:31,253 INFO L89 Accepts]: Start accepts. Operand has 305 places, 419 transitions, 13370 flow [2022-12-13 02:35:31,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:31,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:31,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 419 transitions, 13370 flow [2022-12-13 02:35:31,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 419 transitions, 13370 flow [2022-12-13 02:35:31,508 INFO L130 PetriNetUnfolder]: 462/1508 cut-off events. [2022-12-13 02:35:31,508 INFO L131 PetriNetUnfolder]: For 127032/127666 co-relation queries the response was YES. [2022-12-13 02:35:31,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21084 conditions, 1508 events. 462/1508 cut-off events. For 127032/127666 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 13604 event pairs, 71 based on Foata normal form. 45/1494 useless extension candidates. Maximal degree in co-relation 20747. Up to 571 conditions per place. [2022-12-13 02:35:31,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 419 transitions, 13370 flow [2022-12-13 02:35:31,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 1316 [2022-12-13 02:35:31,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_359| v_~f~0.base_246))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_246 (* v_~x2~0_370 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_246 (* v_~x1~0_454 4))))) (let ((.cse6 (select .cse0 (+ (* .cse3 4) v_~f~0.offset_246))) (.cse5 (select .cse0 (+ v_~f~0.offset_246 (* .cse4 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_246 (* .cse5 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_246 (* .cse6 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_394| 4) (= (select .cse0 (+ v_~f~0.offset_246 (* .cse1 4))) v_~x2~0_369) (= v_~x1~0_452 (select .cse0 (+ v_~f~0.offset_246 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_250)) 1 0)) (= (ite (and (< .cse2 v_~size~0_250) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_250)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254| 0)) (< 3 (* 2 (mod v_~n~0_249 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|) (not (= (ite (and (< .cse4 v_~size~0_250) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_250)) 1 0) 0)) (not (= 0 (ite (and (< v_~x2~0_370 v_~size~0_250) (<= 0 v_~x2~0_370)) 1 0))) (not (= (ite (and (<= 0 v_~x1~0_454) (< v_~x1~0_454 v_~size~0_250)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_250) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254|) (= |v_thread2Thread1of1ForFork1_~i~1#1_313| 4)))))) InVars {~x2~0=v_~x2~0_370, ~size~0=v_~size~0_250, ~f~0.base=v_~f~0.base_246, #memory_int=|v_#memory_int_359|, ~n~0=v_~n~0_249, ~x1~0=v_~x1~0_454, ~f~0.offset=v_~f~0.offset_246} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_256|, ~x2~0=v_~x2~0_369, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_192|, ~size~0=v_~size~0_250, ~f~0.base=v_~f~0.base_246, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_196|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_313|, ~x1~0=v_~x1~0_452, ~f~0.offset=v_~f~0.offset_246, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_394|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254|, #memory_int=|v_#memory_int_359|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_182|, ~n~0=v_~n~0_249, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_264|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_182|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:35:32,563 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:35:32,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1311 [2022-12-13 02:35:32,564 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 419 transitions, 13448 flow [2022-12-13 02:35:32,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:32,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:32,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:32,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 02:35:32,565 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-13 02:35:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash -407022579, now seen corresponding path program 1 times [2022-12-13 02:35:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:32,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737100930] [2022-12-13 02:35:32,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:32,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:33,801 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-13 02:35:33,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737100930] [2022-12-13 02:35:33,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737100930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880950799] [2022-12-13 02:35:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:33,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:33,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:33,803 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-13 02:35:33,805 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-13 02:35:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:33,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:35:33,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:33,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:33,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 02:35:34,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:34,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 02:35:34,072 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-13 02:35:34,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:34,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:34,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 02:35:34,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:34,367 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-13 02:35:37,382 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-13 02:35:37,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880950799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:37,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:37,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 02:35:37,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996186457] [2022-12-13 02:35:37,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:37,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:35:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:37,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:35:37,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=167, Unknown=2, NotChecked=0, Total=210 [2022-12-13 02:35:37,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 02:35:37,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 419 transitions, 13448 flow. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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-13 02:35:37,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:37,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 02:35:37,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:41,834 INFO L130 PetriNetUnfolder]: 2159/4044 cut-off events. [2022-12-13 02:35:41,834 INFO L131 PetriNetUnfolder]: For 323942/323942 co-relation queries the response was YES. [2022-12-13 02:35:41,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56912 conditions, 4044 events. 2159/4044 cut-off events. For 323942/323942 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 28496 event pairs, 908 based on Foata normal form. 1/4035 useless extension candidates. Maximal degree in co-relation 56110. Up to 3740 conditions per place. [2022-12-13 02:35:41,880 INFO L137 encePairwiseOnDemand]: 37/84 looper letters, 349 selfloop transitions, 112 changer transitions 3/464 dead transitions. [2022-12-13 02:35:41,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 464 transitions, 15187 flow [2022-12-13 02:35:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:35:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:35:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2022-12-13 02:35:41,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13690476190476192 [2022-12-13 02:35:41,881 INFO L175 Difference]: Start difference. First operand has 304 places, 419 transitions, 13448 flow. Second operand 14 states and 161 transitions. [2022-12-13 02:35:41,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 464 transitions, 15187 flow [2022-12-13 02:35:42,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 464 transitions, 15150 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-13 02:35:42,850 INFO L231 Difference]: Finished difference. Result has 318 places, 427 transitions, 14098 flow [2022-12-13 02:35:42,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=13411, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14098, PETRI_PLACES=318, PETRI_TRANSITIONS=427} [2022-12-13 02:35:42,851 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 297 predicate places. [2022-12-13 02:35:42,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:42,851 INFO L89 Accepts]: Start accepts. Operand has 318 places, 427 transitions, 14098 flow [2022-12-13 02:35:42,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:42,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:42,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 427 transitions, 14098 flow [2022-12-13 02:35:42,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 316 places, 427 transitions, 14098 flow [2022-12-13 02:35:43,107 INFO L130 PetriNetUnfolder]: 470/1527 cut-off events. [2022-12-13 02:35:43,107 INFO L131 PetriNetUnfolder]: For 134047/134691 co-relation queries the response was YES. [2022-12-13 02:35:43,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21812 conditions, 1527 events. 470/1527 cut-off events. For 134047/134691 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13782 event pairs, 72 based on Foata normal form. 45/1513 useless extension candidates. Maximal degree in co-relation 21440. Up to 580 conditions per place. [2022-12-13 02:35:43,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 316 places, 427 transitions, 14098 flow [2022-12-13 02:35:43,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-13 02:35:43,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_181| v_~f~0.base_110))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_110 (* v_~x1~0_162 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_110 (* v_~x2~0_120 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= (ite (and (< v_~x2~0_120 v_~size~0_122) (<= 0 v_~x2~0_120)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_162) (< v_~x1~0_162 v_~size~0_122)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_136| 2) (< 1 (* 2 (mod v_~n~0_121 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_97|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_122)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= (select .cse1 (+ v_~f~0.offset_110 (* .cse2 4))) v_~x2~0_119) (= v_~x1~0_160 (select .cse1 (+ v_~f~0.offset_110 (* .cse0 4)))) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_122)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0))))) InVars {~x2~0=v_~x2~0_120, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, #memory_int=|v_#memory_int_181|, ~n~0=v_~n~0_121, ~x1~0=v_~x1~0_162, ~f~0.offset=v_~f~0.offset_110} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_88|, ~x2~0=v_~x2~0_119, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_48|, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_97|, ~x1~0=v_~x1~0_160, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86|, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_38|, ~n~0=v_~n~0_121, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_96|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [643] L59-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_251| v_~f~0.base_160))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_160 (* v_~x2~0_189 4)))) (.cse2 (* (mod v_~n~0_165 2147483648) 2))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (= v_~x2~0_188 (select .cse0 (+ v_~f~0.offset_160 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_151|) |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_166)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= v_~x1~0_239 (select .cse0 (+ v_~f~0.offset_160 (* v_~x1~0_240 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| (+ |v_thread1Thread1of1ForFork0_~i~0#1_196| 1)) (not (= (ite (and (< v_~x2~0_189 v_~size~0_166) (<= 0 v_~x2~0_189)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| (ite (and (<= 0 v_~x1~0_240) (< v_~x1~0_240 v_~size~0_166)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_151| 4294967296) .cse2) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_196| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|)))) InVars {~x2~0=v_~x2~0_189, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_196|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_151|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_160} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_127|, ~x2~0=v_~x2~0_188, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_85|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~x1~0=v_~x1~0_239, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_71|, ~n~0=v_~n~0_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:35:43,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 02:35:44,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [683] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_328| v_~f~0.base_224))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_224 (* v_~x2~0_320 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_224 (* .cse3 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_224 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_228) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_224 (* .cse2 4))) v_~x2~0_318) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_228)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_228)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|) (= |v_thread2Thread1of1ForFork1_~i~1#1_271| 4) (not (= (ite (and (< v_~x2~0_320 v_~size~0_228) (<= 0 v_~x2~0_320)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198| 0)) (< 2 (* 2 (mod v_~n~0_227 2147483648)))))))) InVars {~x2~0=v_~x2~0_320, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, #memory_int=|v_#memory_int_328|, ~n~0=v_~n~0_227, ~f~0.offset=v_~f~0.offset_224} OutVars{~x2~0=v_~x2~0_318, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_160|, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_164|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_271|, ~f~0.offset=v_~f~0.offset_224, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|, #memory_int=|v_#memory_int_328|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_150|, ~n~0=v_~n~0_227, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_150|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:35:44,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [684] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~f~0.base_226))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_226 (* v_~x2~0_325 4))))) (and (= v_~x2~0_324 (select .cse0 (+ v_~f~0.offset_226 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (= (select .cse0 (+ v_~f~0.offset_226 (* v_~x1~0_382 4))) v_~x1~0_381) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_339| 4294967296) (* (mod v_~n~0_229 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_275|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| (ite (and (<= 0 v_~x1~0_382) (< v_~x1~0_382 v_~size~0_230)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_230)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_338| (+ |v_thread1Thread1of1ForFork0_~i~0#1_339| 1)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_230) (<= 0 v_~x2~0_325)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_339|, #memory_int=|v_#memory_int_330|, ~n~0=v_~n~0_229, ~x1~0=v_~x1~0_382, ~f~0.offset=v_~f~0.offset_226} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_168|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_275|, ~x1~0=v_~x1~0_381, ~f~0.offset=v_~f~0.offset_226, 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_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, #memory_int=|v_#memory_int_330|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_154|, ~n~0=v_~n~0_229, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_154|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:35:44,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:35:45,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] $Ultimate##0-->L83-3: Formula: (let ((.cse0 (select |v_#memory_int_353| v_~f~0.base_242))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_242 (* v_~x1~0_441 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_242 (* .cse2 4))))) (and (= (select .cse0 (+ v_~f~0.offset_242 (* .cse1 4))) v_~x1~0_440) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_387| 4294967295) 4294967296) (* (mod v_~n~0_245 2147483648) 2)) (= (store |v_#memory_int_353| |v_ULTIMATE.start_main_~#t2~0#1.base_67| (store (select |v_#memory_int_353| |v_ULTIMATE.start_main_~#t2~0#1.base_67|) |v_ULTIMATE.start_main_~#t2~0#1.offset_67| |v_ULTIMATE.start_main_#t~pre12#1_96|)) |v_#memory_int_352|) (= |v_ULTIMATE.start_main_#t~pre12#1_96| |v_#pthreadsForks_106|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_246)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247| 0)) (= (+ |v_#pthreadsForks_106| 1) |v_#pthreadsForks_105|) (= |v_thread1Thread1of1ForFork0_~i~0#1_387| 3) (not (= (ite (and (<= 0 v_~x1~0_441) (< v_~x1~0_441 v_~size~0_246)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_246)) 1 0)))))) InVars {#pthreadsForks=|v_#pthreadsForks_106|, ~size~0=v_~size~0_246, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_67|, ~f~0.base=v_~f~0.base_242, #memory_int=|v_#memory_int_353|, ~n~0=v_~n~0_245, ~x1~0=v_~x1~0_441, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_67|, ~f~0.offset=v_~f~0.offset_242} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_249|, ~size~0=v_~size~0_246, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_67|, ~f~0.base=v_~f~0.base_242, ~x1~0=v_~x1~0_440, ~f~0.offset=v_~f~0.offset_242, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_73|, #pthreadsForks=|v_#pthreadsForks_105|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_387|, #memory_int=|v_#memory_int_352|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247|, ~n~0=v_~n~0_245, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_257|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_67|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:35:45,275 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:35:45,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2425 [2022-12-13 02:35:45,276 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 426 transitions, 14439 flow [2022-12-13 02:35:45,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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-13 02:35:45,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:45,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:45,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 02:35:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:45,476 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-13 02:35:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1308785992, now seen corresponding path program 1 times [2022-12-13 02:35:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:45,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150627949] [2022-12-13 02:35:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:35:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150627949] [2022-12-13 02:35:45,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150627949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591030833] [2022-12-13 02:35:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:45,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:45,523 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-13 02:35:45,525 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-13 02:35:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:45,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:35:45,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:45,947 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-13 02:35:45,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:45,966 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-13 02:35:45,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591030833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:45,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:45,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 02:35:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500047100] [2022-12-13 02:35:45,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:45,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:35:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:35:45,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:35:45,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 92 [2022-12-13 02:35:45,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 426 transitions, 14439 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:45,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:45,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 92 [2022-12-13 02:35:45,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:47,605 INFO L130 PetriNetUnfolder]: 2197/4106 cut-off events. [2022-12-13 02:35:47,605 INFO L131 PetriNetUnfolder]: For 341189/341189 co-relation queries the response was YES. [2022-12-13 02:35:47,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58798 conditions, 4106 events. 2197/4106 cut-off events. For 341189/341189 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 29042 event pairs, 959 based on Foata normal form. 6/4102 useless extension candidates. Maximal degree in co-relation 58189. Up to 3913 conditions per place. [2022-12-13 02:35:47,650 INFO L137 encePairwiseOnDemand]: 67/92 looper letters, 392 selfloop transitions, 59 changer transitions 2/453 dead transitions. [2022-12-13 02:35:47,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 453 transitions, 16082 flow [2022-12-13 02:35:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:35:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:35:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 02:35:47,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20108695652173914 [2022-12-13 02:35:47,651 INFO L175 Difference]: Start difference. First operand has 315 places, 426 transitions, 14439 flow. Second operand 6 states and 111 transitions. [2022-12-13 02:35:47,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 453 transitions, 16082 flow [2022-12-13 02:35:48,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 453 transitions, 15636 flow, removed 151 selfloop flow, removed 8 redundant places. [2022-12-13 02:35:48,626 INFO L231 Difference]: Finished difference. Result has 314 places, 432 transitions, 14263 flow [2022-12-13 02:35:48,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=13999, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14263, PETRI_PLACES=314, PETRI_TRANSITIONS=432} [2022-12-13 02:35:48,626 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 293 predicate places. [2022-12-13 02:35:48,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:48,626 INFO L89 Accepts]: Start accepts. Operand has 314 places, 432 transitions, 14263 flow [2022-12-13 02:35:48,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:48,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:48,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 432 transitions, 14263 flow [2022-12-13 02:35:48,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 432 transitions, 14263 flow [2022-12-13 02:35:48,885 INFO L130 PetriNetUnfolder]: 478/1548 cut-off events. [2022-12-13 02:35:48,885 INFO L131 PetriNetUnfolder]: For 133819/134327 co-relation queries the response was YES. [2022-12-13 02:35:48,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22124 conditions, 1548 events. 478/1548 cut-off events. For 133819/134327 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 13994 event pairs, 70 based on Foata normal form. 35/1526 useless extension candidates. Maximal degree in co-relation 21823. Up to 586 conditions per place. [2022-12-13 02:35:48,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 432 transitions, 14263 flow [2022-12-13 02:35:48,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 1356 [2022-12-13 02:35:49,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_181| v_~f~0.base_110))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_110 (* v_~x1~0_162 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_110 (* v_~x2~0_120 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= (ite (and (< v_~x2~0_120 v_~size~0_122) (<= 0 v_~x2~0_120)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_162) (< v_~x1~0_162 v_~size~0_122)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_136| 2) (< 1 (* 2 (mod v_~n~0_121 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_97|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_122)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= (select .cse1 (+ v_~f~0.offset_110 (* .cse2 4))) v_~x2~0_119) (= v_~x1~0_160 (select .cse1 (+ v_~f~0.offset_110 (* .cse0 4)))) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_122)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0))))) InVars {~x2~0=v_~x2~0_120, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, #memory_int=|v_#memory_int_181|, ~n~0=v_~n~0_121, ~x1~0=v_~x1~0_162, ~f~0.offset=v_~f~0.offset_110} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_88|, ~x2~0=v_~x2~0_119, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_48|, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_97|, ~x1~0=v_~x1~0_160, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86|, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_38|, ~n~0=v_~n~0_121, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_96|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [643] L59-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_251| v_~f~0.base_160))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_160 (* v_~x2~0_189 4)))) (.cse2 (* (mod v_~n~0_165 2147483648) 2))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (= v_~x2~0_188 (select .cse0 (+ v_~f~0.offset_160 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_151|) |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_166)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= v_~x1~0_239 (select .cse0 (+ v_~f~0.offset_160 (* v_~x1~0_240 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| (+ |v_thread1Thread1of1ForFork0_~i~0#1_196| 1)) (not (= (ite (and (< v_~x2~0_189 v_~size~0_166) (<= 0 v_~x2~0_189)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| (ite (and (<= 0 v_~x1~0_240) (< v_~x1~0_240 v_~size~0_166)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_151| 4294967296) .cse2) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_196| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|)))) InVars {~x2~0=v_~x2~0_189, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_196|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_151|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_160} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_127|, ~x2~0=v_~x2~0_188, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_85|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~x1~0=v_~x1~0_239, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_71|, ~n~0=v_~n~0_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:35:49,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_235| v_~f~0.base_144))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_212 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648))) (.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_157 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x1~0_211) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_166| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_150)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4))) v_~x2~0_156) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_121|) |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= (ite (and (< v_~x1~0_212 v_~size~0_150) (<= 0 v_~x1~0_212)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_121| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_165| 4294967295) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= |v_thread1Thread1of1ForFork0_~i~0#1_165| (+ |v_thread1Thread1of1ForFork0_~i~0#1_166| 2)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|)))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, #memory_int=|v_#memory_int_235|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_144} OutVars{~x2~0=v_~x2~0_156, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_113|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_211, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_165|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_121|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [724] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_395| v_~f~0.base_274))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_274 (* v_~x1~0_541 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_274 (* v_~x2~0_432 4)))) (.cse2 (* (mod v_~n~0_277 2147483648) 2)) (.cse3 (select .cse0 (+ v_~f~0.offset_274 (* .cse4 4))))) (and (= v_~x2~0_431 (select .cse0 (+ v_~f~0.offset_274 (* 4 .cse1)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_354| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_355|)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_457| 3) |v_thread1Thread1of1ForFork0_~i~0#1_456|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_311|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_355| 4294967296) .cse2) (= v_~x1~0_540 (select .cse0 (+ v_~f~0.offset_274 (* .cse3 4)))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_278)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| (ite (and (< .cse1 v_~size~0_278) (<= 0 .cse1)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_456| 4294967295) 4294967296) .cse2) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_457| 4294967296) .cse2) (not (= (ite (and (< v_~x1~0_541 v_~size~0_278) (<= 0 v_~x1~0_541)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_311| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295| (ite (and (< .cse3 v_~size~0_278) (<= 0 .cse3)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_432) (< v_~x2~0_432 v_~size~0_278)) 1 0) 0)))))) InVars {~x2~0=v_~x2~0_432, ~size~0=v_~size~0_278, ~f~0.base=v_~f~0.base_274, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_457|, #memory_int=|v_#memory_int_395|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~n~0=v_~n~0_277, ~x1~0=v_~x1~0_541, ~f~0.offset=v_~f~0.offset_274} OutVars{~x2~0=v_~x2~0_431, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_313|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_231|, ~size~0=v_~size~0_278, ~f~0.base=v_~f~0.base_274, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_235|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_354|, ~x1~0=v_~x1~0_540, ~f~0.offset=v_~f~0.offset_274, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_456|, #memory_int=|v_#memory_int_395|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_311|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_221|, ~n~0=v_~n~0_277, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_221|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_321|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 02:35:51,246 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:35:51,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2620 [2022-12-13 02:35:51,247 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 432 transitions, 14344 flow [2022-12-13 02:35:51,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:51,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:51,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:51,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 02:35:51,453 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,SelfDestructingSolverStorable52 [2022-12-13 02:35:51,454 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-13 02:35:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash -334361554, now seen corresponding path program 1 times [2022-12-13 02:35:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:51,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311241168] [2022-12-13 02:35:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:53,893 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-13 02:35:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:53,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311241168] [2022-12-13 02:35:53,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311241168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:53,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177535544] [2022-12-13 02:35:53,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:53,896 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-13 02:35:53,898 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-13 02:35:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:54,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 02:35:54,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:54,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:54,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-12-13 02:35:54,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:54,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 76 [2022-12-13 02:35:54,133 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-13 02:35:54,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:54,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:54,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 02:35:54,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:54,406 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 45 treesize of output 152 [2022-12-13 02:35:57,571 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-13 02:35:57,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177535544] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:57,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:57,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:35:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433531004] [2022-12-13 02:35:57,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:57,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:35:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:35:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:35:57,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 94 [2022-12-13 02:35:57,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 432 transitions, 14344 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-13 02:35:57,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:57,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 94 [2022-12-13 02:35:57,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:59,815 INFO L130 PetriNetUnfolder]: 2340/4368 cut-off events. [2022-12-13 02:35:59,815 INFO L131 PetriNetUnfolder]: For 356674/356674 co-relation queries the response was YES. [2022-12-13 02:35:59,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62699 conditions, 4368 events. 2340/4368 cut-off events. For 356674/356674 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 31096 event pairs, 542 based on Foata normal form. 2/4360 useless extension candidates. Maximal degree in co-relation 62092. Up to 3568 conditions per place. [2022-12-13 02:35:59,872 INFO L137 encePairwiseOnDemand]: 32/94 looper letters, 349 selfloop transitions, 145 changer transitions 9/503 dead transitions. [2022-12-13 02:35:59,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 503 transitions, 16757 flow [2022-12-13 02:35:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:35:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:35:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2022-12-13 02:35:59,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1653771760154739 [2022-12-13 02:35:59,877 INFO L175 Difference]: Start difference. First operand has 311 places, 432 transitions, 14344 flow. Second operand 11 states and 171 transitions. [2022-12-13 02:35:59,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 503 transitions, 16757 flow [2022-12-13 02:36:01,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 503 transitions, 16522 flow, removed 88 selfloop flow, removed 3 redundant places. [2022-12-13 02:36:01,034 INFO L231 Difference]: Finished difference. Result has 321 places, 452 transitions, 15166 flow [2022-12-13 02:36:01,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=14111, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15166, PETRI_PLACES=321, PETRI_TRANSITIONS=452} [2022-12-13 02:36:01,034 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 300 predicate places. [2022-12-13 02:36:01,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:36:01,034 INFO L89 Accepts]: Start accepts. Operand has 321 places, 452 transitions, 15166 flow [2022-12-13 02:36:01,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:36:01,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:36:01,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 452 transitions, 15166 flow [2022-12-13 02:36:01,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 452 transitions, 15166 flow [2022-12-13 02:36:01,422 INFO L130 PetriNetUnfolder]: 510/1644 cut-off events. [2022-12-13 02:36:01,423 INFO L131 PetriNetUnfolder]: For 146993/147534 co-relation queries the response was YES. [2022-12-13 02:36:01,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24077 conditions, 1644 events. 510/1644 cut-off events. For 146993/147534 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15002 event pairs, 83 based on Foata normal form. 35/1617 useless extension candidates. Maximal degree in co-relation 23773. Up to 635 conditions per place. [2022-12-13 02:36:01,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 452 transitions, 15166 flow [2022-12-13 02:36:01,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 1450 [2022-12-13 02:36:01,452 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:36:01,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-13 02:36:01,453 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 452 transitions, 15166 flow [2022-12-13 02:36:01,453 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-13 02:36:01,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:36:01,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:36:01,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 02:36:01,660 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,SelfDestructingSolverStorable53 [2022-12-13 02:36:01,660 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-13 02:36:01,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:36:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1619927248, now seen corresponding path program 1 times [2022-12-13 02:36:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:36:01,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855685020] [2022-12-13 02:36:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:36:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:36:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-13 02:38:38,948 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:38:38,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 02:38:38,950 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-2-2-5-4-6-4-8-3-8-4-6-3-8-3-9-4-9-4-7-4-9-4-9-4-8-5-10-5-10-4-10-5-10-5-10-5-10-5-10-5-10-6-10-6-10-6-10-6-10-6-10-6-10-5-10-6-10-6-10-5-10-6-10-6-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-4-9-5-10-5-10-4-9-5-10-5-10-4-9-4-9-3-8-3-5-2-5-2-3-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-13-2-9-3-5-2-3-2-3-1 context. [2022-12-13 02:38:38,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:38:38,951 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:38:38,954 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:38:38,954 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:38:38,958 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:38:38,958 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:38:38,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:38:38 BasicIcfg [2022-12-13 02:38:38,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:38:38,961 INFO L158 Benchmark]: Toolchain (without parser) took 823623.95ms. Allocated memory was 178.3MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 144.7MB in the beginning and 623.2MB in the end (delta: -478.5MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-13 02:38:38,962 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:38:38,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.29ms. Allocated memory is still 178.3MB. Free memory was 144.2MB in the beginning and 133.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 02:38:38,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.10ms. Allocated memory is still 178.3MB. Free memory was 133.0MB in the beginning and 131.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:38:38,963 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 129.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:38:38,963 INFO L158 Benchmark]: RCFGBuilder took 529.66ms. Allocated memory is still 178.3MB. Free memory was 129.5MB in the beginning and 113.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 02:38:38,964 INFO L158 Benchmark]: TraceAbstraction took 822729.80ms. Allocated memory was 178.3MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 112.2MB in the beginning and 623.2MB in the end (delta: -511.0MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-13 02:38:38,964 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.12ms. Allocated memory is still 178.3MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.29ms. Allocated memory is still 178.3MB. Free memory was 144.2MB in the beginning and 133.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.10ms. Allocated memory is still 178.3MB. Free memory was 133.0MB in the beginning and 131.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 129.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 529.66ms. Allocated memory is still 178.3MB. Free memory was 129.5MB in the beginning and 113.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 822729.80ms. Allocated memory was 178.3MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 112.2MB in the beginning and 623.2MB in the end (delta: -511.0MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 137 PlacesBefore, 21 PlacesAfterwards, 144 TransitionsBefore, 17 TransitionsAfterwards, 1942 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 47 ConcurrentYvCompositions, 11 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 1248, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 0, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2121, Positive conditional cache size: 0, Positive unconditional cache size: 2121, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 36 PlacesBefore, 34 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 41 PlacesBefore, 41 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 204 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): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 50 PlacesBefore, 50 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 276 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): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 57 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 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): 56, Positive cache size: 54, Positive conditional cache size: 32, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 376 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): 56, Positive cache size: 54, Positive conditional cache size: 32, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 400 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): 56, Positive cache size: 54, Positive conditional cache size: 32, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 76 PlacesBefore, 76 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 362 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): 58, Positive cache size: 56, Positive conditional cache size: 34, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 91 PlacesBefore, 90 PlacesAfterwards, 125 TransitionsBefore, 124 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 70, Positive conditional cache size: 41, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 94 PlacesBefore, 96 PlacesAfterwards, 126 TransitionsBefore, 128 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 53, independent conditional: 53, 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: 53, independent: 53, independent conditional: 53, 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: 53, independent: 53, independent conditional: 53, 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: 53, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 100 PlacesBefore, 100 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 85, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 100 PlacesBefore, 99 PlacesAfterwards, 143 TransitionsBefore, 142 TransitionsAfterwards, 382 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): 90, Positive cache size: 88, Positive conditional cache size: 58, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 104 PlacesBefore, 104 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 400 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): 94, Positive cache size: 92, Positive conditional cache size: 62, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 117 PlacesBefore, 117 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 94, Positive cache size: 92, Positive conditional cache size: 62, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 130 PlacesBefore, 130 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 546 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: 95, Positive conditional cache size: 65, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 132 PlacesBefore, 132 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 568 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): 97, Positive cache size: 95, Positive conditional cache size: 65, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 152 PlacesBefore, 152 PlacesAfterwards, 208 TransitionsBefore, 208 TransitionsAfterwards, 644 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): 100, Positive cache size: 98, Positive conditional cache size: 68, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 718 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): 100, Positive cache size: 98, Positive conditional cache size: 68, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 172 PlacesBefore, 172 PlacesAfterwards, 239 TransitionsBefore, 239 TransitionsAfterwards, 762 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): 102, Positive cache size: 100, Positive conditional cache size: 70, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 177 PlacesBefore, 178 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 19, independent conditional: 19, 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 185 PlacesBefore, 185 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 768 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 187 PlacesBefore, 187 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 760 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 190 PlacesBefore, 190 PlacesAfterwards, 255 TransitionsBefore, 255 TransitionsAfterwards, 790 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 193 PlacesBefore, 193 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 808 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 201 PlacesBefore, 200 PlacesAfterwards, 279 TransitionsBefore, 278 TransitionsAfterwards, 878 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): 110, Positive cache size: 108, Positive conditional cache size: 78, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 209 PlacesBefore, 209 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 896 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: 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): 111, Positive cache size: 109, Positive conditional cache size: 79, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 211 PlacesBefore, 211 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 892 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: 110, Positive conditional cache size: 80, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 225 PlacesBefore, 224 PlacesAfterwards, 301 TransitionsBefore, 300 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 131, Positive conditional cache size: 100, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 225 PlacesBefore, 225 PlacesAfterwards, 301 TransitionsBefore, 301 TransitionsAfterwards, 918 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): 133, Positive cache size: 131, Positive conditional cache size: 100, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 237 PlacesBefore, 237 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 986 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): 135, Positive cache size: 133, Positive conditional cache size: 102, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 239 PlacesBefore, 239 PlacesAfterwards, 327 TransitionsBefore, 327 TransitionsAfterwards, 1014 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): 135, Positive cache size: 133, Positive conditional cache size: 102, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 255 PlacesBefore, 255 PlacesAfterwards, 342 TransitionsBefore, 342 TransitionsAfterwards, 1060 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): 138, Positive cache size: 136, Positive conditional cache size: 105, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 252 PlacesBefore, 252 PlacesAfterwards, 342 TransitionsBefore, 342 TransitionsAfterwards, 1062 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 137, Positive conditional cache size: 106, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 261 PlacesBefore, 260 PlacesAfterwards, 369 TransitionsBefore, 368 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 140, Positive conditional cache size: 108, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 265 PlacesBefore, 265 PlacesAfterwards, 373 TransitionsBefore, 373 TransitionsAfterwards, 1156 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 278 PlacesBefore, 278 PlacesAfterwards, 385 TransitionsBefore, 385 TransitionsAfterwards, 1202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 287 PlacesBefore, 287 PlacesAfterwards, 402 TransitionsBefore, 402 TransitionsAfterwards, 1250 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 288 PlacesBefore, 288 PlacesAfterwards, 406 TransitionsBefore, 406 TransitionsAfterwards, 1262 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 291 PlacesBefore, 291 PlacesAfterwards, 412 TransitionsBefore, 412 TransitionsAfterwards, 1300 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 302 PlacesBefore, 302 PlacesAfterwards, 419 TransitionsBefore, 419 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 170, Positive conditional cache size: 137, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 304 PlacesBefore, 304 PlacesAfterwards, 419 TransitionsBefore, 419 TransitionsAfterwards, 1316 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): 173, Positive cache size: 171, Positive conditional cache size: 138, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 316 PlacesBefore, 315 PlacesAfterwards, 427 TransitionsBefore, 426 TransitionsAfterwards, 1340 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): 184, Positive cache size: 182, Positive conditional cache size: 147, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 311 PlacesBefore, 311 PlacesAfterwards, 432 TransitionsBefore, 432 TransitionsAfterwards, 1356 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: 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: 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: 3, independent: 1, independent conditional: 1, 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): 186, Positive cache size: 184, Positive conditional cache size: 149, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 320 PlacesBefore, 320 PlacesAfterwards, 452 TransitionsBefore, 452 TransitionsAfterwards, 1450 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): 186, Positive cache size: 184, Positive conditional cache size: 149, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-2-2-5-4-6-4-8-3-8-4-6-3-8-3-9-4-9-4-7-4-9-4-9-4-8-5-10-5-10-4-10-5-10-5-10-5-10-5-10-5-10-6-10-6-10-6-10-6-10-6-10-6-10-5-10-6-10-6-10-5-10-6-10-6-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-4-9-5-10-5-10-4-9-5-10-5-10-4-9-4-9-3-8-3-5-2-5-2-3-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-13-2-9-3-5-2-3-2-3-1 context. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-2-2-5-4-6-4-8-3-8-4-6-3-8-3-9-4-9-4-7-4-9-4-9-4-8-5-10-5-10-4-10-5-10-5-10-5-10-5-10-5-10-6-10-6-10-6-10-6-10-6-10-6-10-5-10-6-10-6-10-5-10-6-10-6-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-4-9-5-10-5-10-4-9-5-10-5-10-4-9-4-9-3-8-3-5-2-5-2-3-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-13-2-9-3-5-2-3-2-3-1 context. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-2-2-5-4-6-4-8-3-8-4-6-3-8-3-9-4-9-4-7-4-9-4-9-4-8-5-10-5-10-4-10-5-10-5-10-5-10-5-10-5-10-6-10-6-10-6-10-6-10-6-10-6-10-5-10-6-10-6-10-5-10-6-10-6-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-5-10-4-9-5-10-5-10-4-9-5-10-5-10-4-9-4-9-3-8-3-5-2-5-2-3-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-13-2-9-3-5-2-3-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 189 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 822.5s, OverallIterations: 55, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 82.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 1723 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1723 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 20.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19269 IncrementalHoareTripleChecker+Invalid, 20549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1229 mSolverCounterUnsat, 5 mSDtfsCounter, 19269 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1010 GetRequests, 583 SyntacticMatches, 16 SemanticMatches, 411 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15166occurred in iteration=54, InterpolantAutomatonStates: 380, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 517.9s InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1066 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1294 ConstructedInterpolants, 11 QuantifiedInterpolants, 23111 SizeOfPredicates, 194 NumberOfNonLiveVariables, 5099 ConjunctsInSsa, 485 ConjunctsInUnsatCore, 105 InterpolantComputations, 30 PerfectInterpolantSequences, 17/101 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown