/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:10:39,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:10:39,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:10:39,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:10:39,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:10:39,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:10:39,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:10:39,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:10:39,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:10:39,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:10:39,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:10:39,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:10:39,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:10:39,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:10:39,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:10:39,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:10:39,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:10:39,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:10:39,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:10:39,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:10:39,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:10:39,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:10:39,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:10:39,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:10:39,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:10:39,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:10:39,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:10:39,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:10:39,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:10:39,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:10:39,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:10:39,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:10:39,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:10:39,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:10:39,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:10:39,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:10:39,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:10:39,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:10:39,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:10:39,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:10:39,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:10:39,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 11:10:39,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:10:39,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:10:39,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:10:39,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:10:39,929 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:10:39,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:10:39,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:10:39,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:10:39,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:10:39,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:10:39,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:10:39,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:10:39,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:10:39,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:10:39,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:10:39,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:10:39,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:10:39,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:10:39,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:10:39,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:10:39,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:10:39,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:10:39,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:10:39,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:10:39,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:10:39,933 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 11:10:39,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:10:39,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:10:39,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:10:39,934 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 11:10:40,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:10:40,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:10:40,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:10:40,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:10:40,312 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:10:40,313 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 11:10:41,417 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:10:41,682 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:10:41,682 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-13 11:10:41,688 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892d531a4/5c32fd94a9f14057ac40e8afe4e62faa/FLAG0827ec85d [2022-12-13 11:10:41,702 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892d531a4/5c32fd94a9f14057ac40e8afe4e62faa [2022-12-13 11:10:41,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:10:41,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:10:41,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:10:41,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:10:41,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:10:41,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:41,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d16267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41, skipping insertion in model container [2022-12-13 11:10:41,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:41,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:10:41,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:10:41,907 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 11:10:41,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:10:41,923 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:10:41,941 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 11:10:41,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:10:41,957 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:10:41,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41 WrapperNode [2022-12-13 11:10:41,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:10:41,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:10:41,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:10:41,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:10:41,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:41,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,004 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-13 11:10:42,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:10:42,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:10:42,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:10:42,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:10:42,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:10:42,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:10:42,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:10:42,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:10:42,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (1/1) ... [2022-12-13 11:10:42,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:10:42,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:10:42,089 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 11:10:42,108 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 11:10:42,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:10:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 11:10:42,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 11:10:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 11:10:42,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 11:10:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:10:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:10:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:10:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:10:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:10:42,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:10:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:10:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:10:42,144 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 11:10:42,254 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:10:42,256 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:10:42,525 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:10:42,533 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:10:42,533 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 11:10:42,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:10:42 BoogieIcfgContainer [2022-12-13 11:10:42,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:10:42,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:10:42,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:10:42,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:10:42,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:10:41" (1/3) ... [2022-12-13 11:10:42,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79007883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:10:42, skipping insertion in model container [2022-12-13 11:10:42,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:10:41" (2/3) ... [2022-12-13 11:10:42,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79007883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:10:42, skipping insertion in model container [2022-12-13 11:10:42,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:10:42" (3/3) ... [2022-12-13 11:10:42,543 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-13 11:10:42,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:10:42,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:10:42,561 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:10:42,685 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 11:10:42,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 11:10:42,803 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-13 11:10:42,804 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:10:42,809 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 11:10:42,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 11:10:42,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-13 11:10:42,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:42,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 11:10:42,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-13 11:10:42,910 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-13 11:10:42,910 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:10:42,916 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 11:10:42,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 11:10:42,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-13 11:10:47,456 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 11:10:47,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:10:47,483 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;@301db6a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:10:47,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 11:10:47,494 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 11:10:47,494 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:10:47,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:47,495 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:47,495 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 11:10:47,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-13 11:10:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:47,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887224202] [2022-12-13 11:10:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:47,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:47,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887224202] [2022-12-13 11:10:47,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887224202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:47,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:47,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:10:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770767362] [2022-12-13 11:10:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:47,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:10:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:10:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:10:47,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 11:10:47,916 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 11:10:47,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:47,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 11:10:47,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:47,991 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-13 11:10:47,991 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:10:47,992 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 11:10:47,993 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 11:10:47,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 11:10:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:10:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:10:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 11:10:48,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 11:10:48,005 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-13 11:10:48,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 11:10:48,009 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 11:10:48,010 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-13 11:10:48,011 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 11:10:48,015 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 11:10:48,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:48,016 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 11:10:48,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:48,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:48,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 11:10:48,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 11:10:48,031 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 11:10:48,031 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:10:48,031 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 11:10:48,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 11:10:48,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 11:10:49,112 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:10:49,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1099 [2022-12-13 11:10:49,114 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-13 11:10:49,114 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 11:10:49,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:49,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:10:49,115 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 11:10:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-13 11:10:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806228030] [2022-12-13 11:10:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:49,474 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 11:10:49,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:49,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806228030] [2022-12-13 11:10:49,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806228030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:49,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:49,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:10:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859573318] [2022-12-13 11:10:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:10:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:10:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:10:49,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 11:10:49,478 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 11:10:49,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:49,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 11:10:49,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:49,549 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-13 11:10:49,550 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:10:49,550 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 11:10:49,553 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 11:10:49,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-13 11:10:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:10:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:10:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 11:10:49,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 11:10:49,554 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-13 11:10:49,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-13 11:10:49,555 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 11:10:49,555 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-13 11:10:49,556 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 11:10:49,556 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 11:10:49,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:49,557 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 11:10:49,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:49,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:49,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 11:10:49,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 11:10:49,563 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-13 11:10:49,563 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:10:49,564 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 11:10:49,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 11:10:49,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 11:10:49,566 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:10:49,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 11:10:49,567 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-13 11:10:49,567 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 11:10:49,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:49,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:49,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:10:49,568 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 11:10:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash 166108600, now seen corresponding path program 1 times [2022-12-13 11:10:49,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:49,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616934002] [2022-12-13 11:10:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:49,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:49,673 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 11:10:49,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616934002] [2022-12-13 11:10:49,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616934002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:49,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:49,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:10:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298389024] [2022-12-13 11:10:49,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:49,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:10:49,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:49,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:10:49,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:10:49,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 11:10:49,676 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 11:10:49,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:49,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 11:10:49,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:49,807 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-13 11:10:49,808 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 11:10:49,809 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 11:10:49,812 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 6/40 dead transitions. [2022-12-13 11:10:49,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 40 transitions, 193 flow [2022-12-13 11:10:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:10:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:10:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-13 11:10:49,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-13 11:10:49,814 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 39 transitions. [2022-12-13 11:10:49,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 40 transitions, 193 flow [2022-12-13 11:10:49,815 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 11:10:49,816 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-13 11:10:49,816 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 11:10:49,817 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 11:10:49,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:49,818 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-13 11:10:49,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:49,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:49,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-13 11:10:49,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-13 11:10:49,828 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-13 11:10:49,828 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 11:10:49,828 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 11:10:49,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-13 11:10:49,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 11:10:50,065 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:10:50,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-13 11:10:50,067 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-13 11:10:50,067 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 11:10:50,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:50,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:50,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:10:50,068 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 11:10:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1536303008, now seen corresponding path program 1 times [2022-12-13 11:10:50,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:50,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320282101] [2022-12-13 11:10:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:50,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:50,208 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 11:10:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320282101] [2022-12-13 11:10:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320282101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:10:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327105921] [2022-12-13 11:10:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:50,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:10:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:10:50,219 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 11:10:50,223 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 11:10:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:50,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:10:50,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:10:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:50,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:10:50,431 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 11:10:50,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327105921] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 11:10:50,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:10:50,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-13 11:10:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283273804] [2022-12-13 11:10:50,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:50,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:10:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:50,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:10:50,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:10:50,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 11:10:50,434 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 11:10:50,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:50,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 11:10:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:50,503 INFO L130 PetriNetUnfolder]: 59/109 cut-off events. [2022-12-13 11:10:50,503 INFO L131 PetriNetUnfolder]: For 168/174 co-relation queries the response was YES. [2022-12-13 11:10:50,504 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 11:10:50,506 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-12-13 11:10:50,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-13 11:10:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:10:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:10:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 11:10:50,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 11:10:50,508 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-13 11:10:50,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-13 11:10:50,510 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 11:10:50,511 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-13 11:10:50,511 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 11:10:50,512 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 11:10:50,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:50,512 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-13 11:10:50,513 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:50,513 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:50,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-13 11:10:50,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-13 11:10:50,517 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-13 11:10:50,518 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 11:10:50,518 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 39 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 11:10:50,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-13 11:10:50,519 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 11:10:50,519 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:10:50,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 11:10:50,520 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-13 11:10:50,520 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 11:10:50,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:50,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:50,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 11:10:50,721 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 11:10:50,722 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 11:10:50,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash -774279310, now seen corresponding path program 1 times [2022-12-13 11:10:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:50,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979427138] [2022-12-13 11:10:50,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:50,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:50,795 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 11:10:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:50,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979427138] [2022-12-13 11:10:50,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979427138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:10:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103063726] [2022-12-13 11:10:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:10:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:10:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:10:50,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 11:10:50,798 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 11:10:50,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:50,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 11:10:50,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:50,892 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-13 11:10:50,892 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 11:10:50,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 119 events. 61/119 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 315 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 11:10:50,896 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-13 11:10:50,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 184 flow [2022-12-13 11:10:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:10:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:10:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 11:10:50,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 11:10:50,899 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-13 11:10:50,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 35 transitions, 184 flow [2022-12-13 11:10:50,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 11:10:50,904 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-13 11:10:50,904 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 11:10:50,907 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 11:10:50,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:50,907 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 11:10:50,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:50,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:50,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 11:10:50,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 11:10:50,915 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-13 11:10:50,915 INFO L131 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2022-12-13 11:10:50,915 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 11:10:50,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 11:10:50,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 11:10:51,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:10:51,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-13 11:10:51,128 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-13 11:10:51,128 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 11:10:51,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:51,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:51,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:10:51,129 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 11:10:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash 448838783, now seen corresponding path program 1 times [2022-12-13 11:10:51,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:51,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152370475] [2022-12-13 11:10:51,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:51,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:51,213 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 11:10:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:51,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152370475] [2022-12-13 11:10:51,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152370475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:51,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:51,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:10:51,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458413277] [2022-12-13 11:10:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:51,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:10:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:10:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:10:51,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 11:10:51,224 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 11:10:51,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:51,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 11:10:51,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:51,283 INFO L130 PetriNetUnfolder]: 44/84 cut-off events. [2022-12-13 11:10:51,283 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-13 11:10:51,284 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 174 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 11:10:51,284 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 3/25 dead transitions. [2022-12-13 11:10:51,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 143 flow [2022-12-13 11:10:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:10:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:10:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 11:10:51,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 11:10:51,286 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 26 transitions. [2022-12-13 11:10:51,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 143 flow [2022-12-13 11:10:51,289 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 11:10:51,290 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-13 11:10:51,290 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 11:10:51,292 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 11:10:51,292 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:51,292 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-13 11:10:51,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:51,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:51,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-13 11:10:51,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-13 11:10:51,297 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-13 11:10:51,297 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 11:10:51,298 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 4. Compared 21 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 11:10:51,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-13 11:10:51,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 11:10:51,299 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:10:51,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 11:10:51,301 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-13 11:10:51,301 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 11:10:51,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:51,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:51,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:10:51,301 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 11:10:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1385749717, now seen corresponding path program 1 times [2022-12-13 11:10:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:51,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227586109] [2022-12-13 11:10:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:51,419 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 11:10:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:51,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227586109] [2022-12-13 11:10:51,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227586109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:51,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:51,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:10:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806240559] [2022-12-13 11:10:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:51,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:10:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:10:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:10:51,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:10:51,423 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 11:10:51,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:51,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:10:51,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:51,506 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-13 11:10:51,506 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 11:10:51,506 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 11:10:51,507 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-13 11:10:51,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 176 flow [2022-12-13 11:10:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:10:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:10:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 11:10:51,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-13 11:10:51,509 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-13 11:10:51,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 176 flow [2022-12-13 11:10:51,510 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 11:10:51,511 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 87 flow [2022-12-13 11:10:51,512 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 11:10:51,512 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 11:10:51,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:51,512 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 87 flow [2022-12-13 11:10:51,513 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:51,513 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:51,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-13 11:10:51,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 87 flow [2022-12-13 11:10:51,518 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-13 11:10:51,518 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 11:10:51,519 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 74 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 11:10:51,519 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-13 11:10:51,519 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 11:10:51,520 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:10:51,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 11:10:51,524 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 87 flow [2022-12-13 11:10:51,524 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 11:10:51,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:51,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:51,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:10:51,525 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 11:10:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1328554519, now seen corresponding path program 2 times [2022-12-13 11:10:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:51,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464204402] [2022-12-13 11:10:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:51,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:51,618 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 11:10:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464204402] [2022-12-13 11:10:51,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464204402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:51,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:51,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:10:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905042461] [2022-12-13 11:10:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:51,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:10:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:10:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:10:51,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:10:51,622 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 11:10:51,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:51,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:10:51,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:51,717 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-13 11:10:51,717 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 11:10:51,718 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 199 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 11:10:51,719 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2022-12-13 11:10:51,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 154 flow [2022-12-13 11:10:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:10:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:10:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 11:10:51,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 11:10:51,721 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 87 flow. Second operand 3 states and 27 transitions. [2022-12-13 11:10:51,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 154 flow [2022-12-13 11:10:51,725 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 11:10:51,727 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2022-12-13 11:10:51,727 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 11:10:51,729 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 11:10:51,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:51,729 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 78 flow [2022-12-13 11:10:51,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:51,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:51,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-13 11:10:51,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 78 flow [2022-12-13 11:10:51,735 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-13 11:10:51,735 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:10:51,736 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 11:10:51,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-13 11:10:51,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 11:10:51,742 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:10:51,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 11:10:51,745 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-13 11:10:51,745 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 11:10:51,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:51,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:51,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:10:51,745 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 11:10:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2064777642, now seen corresponding path program 1 times [2022-12-13 11:10:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:51,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415748092] [2022-12-13 11:10:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:52,271 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 11:10:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415748092] [2022-12-13 11:10:52,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415748092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:10:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538324497] [2022-12-13 11:10:52,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:52,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:10:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:10:52,274 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 11:10:52,276 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 11:10:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:52,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 11:10:52,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:10:52,442 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 11:10:52,477 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 11:10:52,505 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 11:10:52,631 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-13 11:10:52,632 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 11:10:52,653 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 11:10:52,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:10:54,820 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 11:10:56,812 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 11:10:56,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538324497] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:10:56,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:10:56,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 11:10:56,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917814352] [2022-12-13 11:10:56,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:10:56,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 11:10:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:56,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 11:10:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2022-12-13 11:10:56,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:10:56,815 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 11:10:56,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:56,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:10:56,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:57,346 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2022-12-13 11:10:57,346 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 11:10:57,346 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 667 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 11:10:57,347 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 20 selfloop transitions, 4 changer transitions 37/61 dead transitions. [2022-12-13 11:10:57,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 61 transitions, 343 flow [2022-12-13 11:10:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:10:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:10:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-13 11:10:57,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-13 11:10:57,351 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 9 states and 60 transitions. [2022-12-13 11:10:57,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 61 transitions, 343 flow [2022-12-13 11:10:57,352 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 11:10:57,353 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 100 flow [2022-12-13 11:10:57,353 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 11:10:57,354 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 11:10:57,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:57,354 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 100 flow [2022-12-13 11:10:57,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:57,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:57,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 100 flow [2022-12-13 11:10:57,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 100 flow [2022-12-13 11:10:57,362 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-13 11:10:57,362 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 11:10:57,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 30 events. 8/30 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 71. Up to 13 conditions per place. [2022-12-13 11:10:57,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 100 flow [2022-12-13 11:10:57,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 11:10:58,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:10:58,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1085 [2022-12-13 11:10:58,439 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 96 flow [2022-12-13 11:10:58,439 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 11:10:58,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:58,440 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:58,449 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 11:10:58,646 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 11:10:58,646 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 11:10:58,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -380380717, now seen corresponding path program 1 times [2022-12-13 11:10:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:58,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313634310] [2022-12-13 11:10:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:59,578 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 11:10:59,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:59,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313634310] [2022-12-13 11:10:59,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313634310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:10:59,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417428972] [2022-12-13 11:10:59,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:59,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:10:59,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:10:59,584 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 11:10:59,611 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 11:10:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:59,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 11:10:59,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:10:59,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:10:59,767 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 11:10:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:59,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:10:59,853 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-13 11:10:59,853 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 11:10:59,917 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 11:10:59,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417428972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:10:59,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:10:59,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-13 11:10:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111580894] [2022-12-13 11:10:59,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:10:59,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:10:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:10:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:10:59,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:10:59,919 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 11:10:59,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:59,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:10:59,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:00,373 INFO L130 PetriNetUnfolder]: 139/255 cut-off events. [2022-12-13 11:11:00,374 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-13 11:11:00,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 255 events. 139/255 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 806 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 11:11:00,376 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 57 selfloop transitions, 25 changer transitions 1/83 dead transitions. [2022-12-13 11:11:00,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 507 flow [2022-12-13 11:11:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:11:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 11:11:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2022-12-13 11:11:00,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36403508771929827 [2022-12-13 11:11:00,377 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 96 flow. Second operand 12 states and 83 transitions. [2022-12-13 11:11:00,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 507 flow [2022-12-13 11:11:00,379 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 11:11:00,380 INFO L231 Difference]: Finished difference. Result has 36 places, 44 transitions, 246 flow [2022-12-13 11:11:00,381 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 11:11:00,381 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 11:11:00,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:00,381 INFO L89 Accepts]: Start accepts. Operand has 36 places, 44 transitions, 246 flow [2022-12-13 11:11:00,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:00,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:00,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-13 11:11:00,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 44 transitions, 246 flow [2022-12-13 11:11:00,392 INFO L130 PetriNetUnfolder]: 24/86 cut-off events. [2022-12-13 11:11:00,392 INFO L131 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2022-12-13 11:11:00,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 86 events. 24/86 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 279 event pairs, 1 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 169. Up to 36 conditions per place. [2022-12-13 11:11:00,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-13 11:11:00,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 11:11:03,666 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 11:11:03,735 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 11:11:04,111 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 11:11:04,313 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 11:11:04,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_181| v_~f~0.base_108))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_108 (* v_~x2~0_116 4))))) (and (= (select .cse0 (+ v_~f~0.offset_108 (* v_~x1~0_147 4))) v_~x1~0_146) (= (ite (and (<= 0 v_~x1~0_147) (< v_~x1~0_147 v_~size~0_118)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) (* (mod v_~n~0_118 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (= (select .cse0 (+ v_~f~0.offset_108 (* .cse1 4))) v_~x2~0_115) (not (= 0 (ite (and (<= 0 v_~x2~0_116) (< v_~x2~0_116 v_~size~0_118)) 1 0))) (= (ite (and (< .cse1 v_~size~0_118) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (= |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)) (= |v_thread1Thread1of1ForFork0_~i~0#1_130| 1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|)))) InVars {~x2~0=v_~x2~0_116, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_108, #memory_int=|v_#memory_int_181|, ~n~0=v_~n~0_118, ~x1~0=v_~x1~0_147, ~f~0.offset=v_~f~0.offset_108} OutVars{~x2~0=v_~x2~0_115, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_78|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_44|, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_108, 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_146, ~f~0.offset=v_~f~0.offset_108, 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_60|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_181|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_34|, ~n~0=v_~n~0_118, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_34|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_86|} 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 11:11:04,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] $Ultimate##0-->L83-3: Formula: (and (= |v_#pthreadsForks_71| (+ |v_#pthreadsForks_72| 1)) (= v_~x1~0_162 (select (select |v_#memory_int_188| v_~f~0.base_114) (+ v_~f~0.offset_114 (* v_~x1~0_163 4)))) (= (ite (and (< v_~x1~0_163 v_~size~0_124) (<= 0 v_~x1~0_163)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967295) 4294967296) (* (mod v_~n~0_124 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 1) (= |v_ULTIMATE.start_main_#t~pre12#1_58| |v_#pthreadsForks_72|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_51| |v_ULTIMATE.start_main_#t~pre12#1_58|)) |v_#memory_int_187|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|)) InVars {#pthreadsForks=|v_#pthreadsForks_72|, ~size~0=v_~size~0_124, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~f~0.base=v_~f~0.base_114, #memory_int=|v_#memory_int_188|, ~n~0=v_~n~0_124, ~x1~0=v_~x1~0_163, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ~f~0.offset=v_~f~0.offset_114} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_88|, ~size~0=v_~size~0_124, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~f~0.base=v_~f~0.base_114, ~x1~0=v_~x1~0_162, ~f~0.offset=v_~f~0.offset_114, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_47|, #pthreadsForks=|v_#pthreadsForks_71|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_63|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, #memory_int=|v_#memory_int_187|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86|, ~n~0=v_~n~0_124, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_96|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} 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 11:11:04,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [621] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_193| v_~f~0.base_118))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_118 (* v_~x2~0_120 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (not (= (ite (and (< v_~x2~0_120 v_~size~0_128) (<= 0 v_~x2~0_120)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_118 (* .cse1 4))) v_~x2~0_119) (= (ite (and (<= 0 v_~x1~0_173) (< v_~x1~0_173 v_~size~0_128)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (= v_~x1~0_172 (select .cse0 (+ v_~f~0.offset_118 (* v_~x1~0_173 4)))) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_95|) (= (ite (and (< .cse1 v_~size~0_128) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_146| 4294967295) 4294967296) (* (mod v_~n~0_128 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_~i~0#1_146| 1)))) InVars {~x2~0=v_~x2~0_120, ~size~0=v_~size~0_128, ~f~0.base=v_~f~0.base_118, #memory_int=|v_#memory_int_193|, ~n~0=v_~n~0_128, ~x1~0=v_~x1~0_173, ~f~0.offset=v_~f~0.offset_118} OutVars{~x2~0=v_~x2~0_119, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_94|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, ~size~0=v_~size~0_128, ~f~0.base=v_~f~0.base_118, 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_172, ~f~0.offset=v_~f~0.offset_118, 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_76|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_146|, #memory_int=|v_#memory_int_193|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_36|, ~n~0=v_~n~0_128, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_36|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_102|} 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 11:11:05,221 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 11:11:05,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4841 [2022-12-13 11:11:05,222 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-13 11:11:05,222 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 11:11:05,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:05,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:05,231 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 11:11:05,431 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 11:11:05,432 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 11:11:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash 595885082, now seen corresponding path program 1 times [2022-12-13 11:11:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:05,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810363056] [2022-12-13 11:11:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:05,979 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 11:11:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810363056] [2022-12-13 11:11:05,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810363056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:05,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:05,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:05,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724437727] [2022-12-13 11:11:05,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:05,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:05,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:05,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:11:05,982 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 11:11:05,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:05,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:11:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:06,113 INFO L130 PetriNetUnfolder]: 151/272 cut-off events. [2022-12-13 11:11:06,114 INFO L131 PetriNetUnfolder]: For 331/331 co-relation queries the response was YES. [2022-12-13 11:11:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 272 events. 151/272 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 890 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 11:11:06,116 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2022-12-13 11:11:06,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 425 flow [2022-12-13 11:11:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:11:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:11:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-13 11:11:06,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-13 11:11:06,118 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 4 states and 46 transitions. [2022-12-13 11:11:06,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 425 flow [2022-12-13 11:11:06,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 349 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:06,120 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 249 flow [2022-12-13 11:11:06,120 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2022-12-13 11:11:06,121 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 11:11:06,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:06,121 INFO L89 Accepts]: Start accepts. Operand has 36 places, 43 transitions, 249 flow [2022-12-13 11:11:06,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:06,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:06,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 43 transitions, 249 flow [2022-12-13 11:11:06,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 43 transitions, 249 flow [2022-12-13 11:11:06,132 INFO L130 PetriNetUnfolder]: 25/88 cut-off events. [2022-12-13 11:11:06,132 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-13 11:11:06,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 88 events. 25/88 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 313 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 184. Up to 30 conditions per place. [2022-12-13 11:11:06,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 43 transitions, 249 flow [2022-12-13 11:11:06,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 11:11:06,134 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:06,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 11:11:06,134 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 43 transitions, 249 flow [2022-12-13 11:11:06,134 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 11:11:06,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:06,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:06,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:11:06,135 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 11:11:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 358399162, now seen corresponding path program 1 times [2022-12-13 11:11:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:06,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426874798] [2022-12-13 11:11:06,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:06,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:06,896 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 11:11:06,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:06,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426874798] [2022-12-13 11:11:06,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426874798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:06,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:06,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:11:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642290108] [2022-12-13 11:11:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:06,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:06,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:06,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 11:11:06,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 43 transitions, 249 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:06,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:06,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 11:11:06,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:07,099 INFO L130 PetriNetUnfolder]: 222/392 cut-off events. [2022-12-13 11:11:07,100 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-13 11:11:07,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 392 events. 222/392 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1481 event pairs, 26 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 881. Up to 256 conditions per place. [2022-12-13 11:11:07,103 INFO L137 encePairwiseOnDemand]: 9/29 looper letters, 43 selfloop transitions, 32 changer transitions 1/76 dead transitions. [2022-12-13 11:11:07,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 76 transitions, 561 flow [2022-12-13 11:11:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:11:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 11:11:07,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3505747126436782 [2022-12-13 11:11:07,104 INFO L175 Difference]: Start difference. First operand has 35 places, 43 transitions, 249 flow. Second operand 6 states and 61 transitions. [2022-12-13 11:11:07,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 76 transitions, 561 flow [2022-12-13 11:11:07,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 76 transitions, 531 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 11:11:07,108 INFO L231 Difference]: Finished difference. Result has 41 places, 60 transitions, 466 flow [2022-12-13 11:11:07,108 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=466, PETRI_PLACES=41, PETRI_TRANSITIONS=60} [2022-12-13 11:11:07,108 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-13 11:11:07,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:07,108 INFO L89 Accepts]: Start accepts. Operand has 41 places, 60 transitions, 466 flow [2022-12-13 11:11:07,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:07,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:07,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 60 transitions, 466 flow [2022-12-13 11:11:07,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 60 transitions, 466 flow [2022-12-13 11:11:07,122 INFO L130 PetriNetUnfolder]: 37/122 cut-off events. [2022-12-13 11:11:07,123 INFO L131 PetriNetUnfolder]: For 116/121 co-relation queries the response was YES. [2022-12-13 11:11:07,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 122 events. 37/122 cut-off events. For 116/121 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 0 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 313. Up to 42 conditions per place. [2022-12-13 11:11:07,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 60 transitions, 466 flow [2022-12-13 11:11:07,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-13 11:11:07,125 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:07,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 11:11:07,126 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 60 transitions, 466 flow [2022-12-13 11:11:07,126 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 11:11:07,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:07,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:07,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:11:07,126 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 11:11:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1004006619, now seen corresponding path program 1 times [2022-12-13 11:11:07,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:07,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74829080] [2022-12-13 11:11:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:07,215 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 11:11:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:07,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74829080] [2022-12-13 11:11:07,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74829080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:07,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:07,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:11:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760897403] [2022-12-13 11:11:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:07,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:07,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 11:11:07,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 60 transitions, 466 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 11:11:07,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:07,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 11:11:07,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:07,429 INFO L130 PetriNetUnfolder]: 292/520 cut-off events. [2022-12-13 11:11:07,430 INFO L131 PetriNetUnfolder]: For 834/834 co-relation queries the response was YES. [2022-12-13 11:11:07,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2006 conditions, 520 events. 292/520 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2134 event pairs, 110 based on Foata normal form. 12/512 useless extension candidates. Maximal degree in co-relation 1447. Up to 369 conditions per place. [2022-12-13 11:11:07,434 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 84 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2022-12-13 11:11:07,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 95 transitions, 820 flow [2022-12-13 11:11:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:11:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-13 11:11:07,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3850574712643678 [2022-12-13 11:11:07,436 INFO L175 Difference]: Start difference. First operand has 41 places, 60 transitions, 466 flow. Second operand 6 states and 67 transitions. [2022-12-13 11:11:07,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 95 transitions, 820 flow [2022-12-13 11:11:07,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 818 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 11:11:07,442 INFO L231 Difference]: Finished difference. Result has 49 places, 66 transitions, 560 flow [2022-12-13 11:11:07,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=49, PETRI_TRANSITIONS=66} [2022-12-13 11:11:07,443 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-13 11:11:07,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:07,443 INFO L89 Accepts]: Start accepts. Operand has 49 places, 66 transitions, 560 flow [2022-12-13 11:11:07,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:07,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:07,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 66 transitions, 560 flow [2022-12-13 11:11:07,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 66 transitions, 560 flow [2022-12-13 11:11:07,460 INFO L130 PetriNetUnfolder]: 48/168 cut-off events. [2022-12-13 11:11:07,460 INFO L131 PetriNetUnfolder]: For 284/297 co-relation queries the response was YES. [2022-12-13 11:11:07,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 168 events. 48/168 cut-off events. For 284/297 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 826 event pairs, 1 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 451. Up to 60 conditions per place. [2022-12-13 11:11:07,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 66 transitions, 560 flow [2022-12-13 11:11:07,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 11:11:07,489 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 11:11:07,854 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:11:07,855 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 412 [2022-12-13 11:11:07,855 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 65 transitions, 557 flow [2022-12-13 11:11:07,856 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 11:11:07,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:07,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:07,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:11:07,856 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 11:11:07,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1976606309, now seen corresponding path program 1 times [2022-12-13 11:11:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071436384] [2022-12-13 11:11:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:08,466 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 11:11:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:08,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071436384] [2022-12-13 11:11:08,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071436384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:08,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927998166] [2022-12-13 11:11:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:08,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:08,472 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 11:11:08,490 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 11:11:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:08,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 11:11:08,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:08,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:11:08,594 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 11:11:08,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:08,634 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 11:11:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:08,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:08,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:08,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 11:11:08,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:08,738 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 11:11:08,896 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 11:11:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927998166] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:08,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 11:11:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619584452] [2022-12-13 11:11:08,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:08,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:11:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:11:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:11:08,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 11:11:08,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 65 transitions, 557 flow. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:08,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:08,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 11:11:08,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:09,274 INFO L130 PetriNetUnfolder]: 360/650 cut-off events. [2022-12-13 11:11:09,275 INFO L131 PetriNetUnfolder]: For 1911/1911 co-relation queries the response was YES. [2022-12-13 11:11:09,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 650 events. 360/650 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2978 event pairs, 50 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 2152. Up to 327 conditions per place. [2022-12-13 11:11:09,281 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 63 selfloop transitions, 47 changer transitions 5/115 dead transitions. [2022-12-13 11:11:09,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 115 transitions, 1048 flow [2022-12-13 11:11:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:11:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 11:11:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-12-13 11:11:09,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2838709677419355 [2022-12-13 11:11:09,282 INFO L175 Difference]: Start difference. First operand has 49 places, 65 transitions, 557 flow. Second operand 10 states and 88 transitions. [2022-12-13 11:11:09,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 115 transitions, 1048 flow [2022-12-13 11:11:09,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 1036 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-13 11:11:09,293 INFO L231 Difference]: Finished difference. Result has 60 places, 74 transitions, 781 flow [2022-12-13 11:11:09,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=781, PETRI_PLACES=60, PETRI_TRANSITIONS=74} [2022-12-13 11:11:09,293 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 39 predicate places. [2022-12-13 11:11:09,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:09,294 INFO L89 Accepts]: Start accepts. Operand has 60 places, 74 transitions, 781 flow [2022-12-13 11:11:09,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:09,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:09,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 74 transitions, 781 flow [2022-12-13 11:11:09,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 74 transitions, 781 flow [2022-12-13 11:11:09,331 INFO L130 PetriNetUnfolder]: 54/200 cut-off events. [2022-12-13 11:11:09,331 INFO L131 PetriNetUnfolder]: For 537/558 co-relation queries the response was YES. [2022-12-13 11:11:09,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 200 events. 54/200 cut-off events. For 537/558 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1085 event pairs, 1 based on Foata normal form. 3/197 useless extension candidates. Maximal degree in co-relation 647. Up to 69 conditions per place. [2022-12-13 11:11:09,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 74 transitions, 781 flow [2022-12-13 11:11:09,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 11:11:09,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L83-3: Formula: (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_128| 4294967295) 4294967296) (* (mod v_~n~0_116 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| 0)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_main_~#t2~0#1.base_49| (store (select |v_#memory_int_178| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) |v_ULTIMATE.start_main_~#t2~0#1.offset_49| |v_ULTIMATE.start_main_#t~pre12#1_56|)) |v_#memory_int_177|) (= (ite (and (<= 0 v_~x1~0_143) (< v_~x1~0_143 v_~size~0_116)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= (select (select |v_#memory_int_178| v_~f~0.base_106) (+ v_~f~0.offset_106 (* v_~x1~0_143 4))) v_~x1~0_142) (= |v_ULTIMATE.start_main_#t~pre12#1_56| |v_#pthreadsForks_68|) (= |v_thread1Thread1of1ForFork0_~i~0#1_128| 1) (= |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_49|, ~f~0.base=v_~f~0.base_106, #memory_int=|v_#memory_int_178|, ~n~0=v_~n~0_116, ~x1~0=v_~x1~0_143, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ~f~0.offset=v_~f~0.offset_106} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_76|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, ~f~0.base=v_~f~0.base_106, ~x1~0=v_~x1~0_142, ~f~0.offset=v_~f~0.offset_106, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_56|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_45|, #pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_128|, #memory_int=|v_#memory_int_177|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74|, ~n~0=v_~n~0_116, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_84|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|} 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 11:11:11,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_197| v_~f~0.base_122))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_122 (* v_~x2~0_124 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (= v_~x1~0_182 (select .cse0 (+ v_~f~0.offset_122 (* 4 .cse1)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_152| 2) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_132)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (= (select .cse0 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x2~0_123) (= (ite (and (< .cse1 v_~size~0_132) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_97|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_152| 4294967294) 4294967296) (* (mod v_~n~0_132 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0)) (not (= (ite (and (<= 0 v_~x2~0_124) (< v_~x2~0_124 v_~size~0_132)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_124, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_197|, ~n~0=v_~n~0_132, ~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|, ~x2~0=v_~x2~0_123, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_48|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, 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_182, ~f~0.offset=v_~f~0.offset_122, 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_82|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_197|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_38|, ~n~0=v_~n~0_132, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, 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 [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 11:11:11,661 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:11:11,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2367 [2022-12-13 11:11:11,662 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 74 transitions, 810 flow [2022-12-13 11:11:11,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:11,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:11,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:11,673 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 11:11:11,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:11,863 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 11:11:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash -892525145, now seen corresponding path program 2 times [2022-12-13 11:11:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:11,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578558129] [2022-12-13 11:11:11,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:12,610 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 11:11:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:12,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578558129] [2022-12-13 11:11:12,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578558129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:12,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706586225] [2022-12-13 11:11:12,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:11:12,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:12,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:12,612 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 11:11:12,615 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 11:11:12,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:11:12,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:11:12,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 11:11:12,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:12,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:11:12,754 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 11:11:12,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:12,800 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 11:11:12,808 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 11:11:12,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:12,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:12,876 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 11:11:12,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:12,897 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 11:11:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:13,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706586225] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:13,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:13,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 11:11:13,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631794882] [2022-12-13 11:11:13,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:13,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:11:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:11:13,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:11:13,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 11:11:13,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 74 transitions, 810 flow. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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 11:11:13,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:13,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 11:11:13,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:13,741 INFO L130 PetriNetUnfolder]: 514/941 cut-off events. [2022-12-13 11:11:13,741 INFO L131 PetriNetUnfolder]: For 3935/3935 co-relation queries the response was YES. [2022-12-13 11:11:13,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 941 events. 514/941 cut-off events. For 3935/3935 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4787 event pairs, 134 based on Foata normal form. 4/934 useless extension candidates. Maximal degree in co-relation 3884. Up to 594 conditions per place. [2022-12-13 11:11:13,750 INFO L137 encePairwiseOnDemand]: 12/34 looper letters, 103 selfloop transitions, 45 changer transitions 5/153 dead transitions. [2022-12-13 11:11:13,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 153 transitions, 1655 flow [2022-12-13 11:11:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:11:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 11:11:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2022-12-13 11:11:13,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2647058823529412 [2022-12-13 11:11:13,752 INFO L175 Difference]: Start difference. First operand has 58 places, 74 transitions, 810 flow. Second operand 13 states and 117 transitions. [2022-12-13 11:11:13,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 153 transitions, 1655 flow [2022-12-13 11:11:13,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 153 transitions, 1530 flow, removed 50 selfloop flow, removed 5 redundant places. [2022-12-13 11:11:13,764 INFO L231 Difference]: Finished difference. Result has 71 places, 96 transitions, 1170 flow [2022-12-13 11:11:13,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1170, PETRI_PLACES=71, PETRI_TRANSITIONS=96} [2022-12-13 11:11:13,764 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-13 11:11:13,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:13,765 INFO L89 Accepts]: Start accepts. Operand has 71 places, 96 transitions, 1170 flow [2022-12-13 11:11:13,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:13,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:13,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 96 transitions, 1170 flow [2022-12-13 11:11:13,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 96 transitions, 1170 flow [2022-12-13 11:11:13,795 INFO L130 PetriNetUnfolder]: 73/281 cut-off events. [2022-12-13 11:11:13,795 INFO L131 PetriNetUnfolder]: For 1110/1154 co-relation queries the response was YES. [2022-12-13 11:11:13,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 281 events. 73/281 cut-off events. For 1110/1154 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1731 event pairs, 5 based on Foata normal form. 9/281 useless extension candidates. Maximal degree in co-relation 1127. Up to 99 conditions per place. [2022-12-13 11:11:13,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 96 transitions, 1170 flow [2022-12-13 11:11:13,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 11:11:13,815 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 11:11:14,193 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 11:11:14,381 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:11:14,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 617 [2022-12-13 11:11:14,382 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 96 transitions, 1187 flow [2022-12-13 11:11:14,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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 11:11:14,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:14,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:14,392 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 11:11:14,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 11:11:14,583 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 11:11:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1694383894, now seen corresponding path program 1 times [2022-12-13 11:11:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:14,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142251151] [2022-12-13 11:11:14,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:14,631 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 11:11:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:14,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142251151] [2022-12-13 11:11:14,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142251151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:14,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:14,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46425992] [2022-12-13 11:11:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:14,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:11:14,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:14,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:11:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:11:14,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 11:11:14,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 96 transitions, 1187 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:14,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:14,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 11:11:14,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:14,829 INFO L130 PetriNetUnfolder]: 496/907 cut-off events. [2022-12-13 11:11:14,829 INFO L131 PetriNetUnfolder]: For 4433/4433 co-relation queries the response was YES. [2022-12-13 11:11:14,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4515 conditions, 907 events. 496/907 cut-off events. For 4433/4433 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4507 event pairs, 240 based on Foata normal form. 24/923 useless extension candidates. Maximal degree in co-relation 4247. Up to 874 conditions per place. [2022-12-13 11:11:14,838 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 99 selfloop transitions, 5 changer transitions 1/105 dead transitions. [2022-12-13 11:11:14,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 1488 flow [2022-12-13 11:11:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:11:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:11:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 11:11:14,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-13 11:11:14,839 INFO L175 Difference]: Start difference. First operand has 70 places, 96 transitions, 1187 flow. Second operand 3 states and 43 transitions. [2022-12-13 11:11:14,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 1488 flow [2022-12-13 11:11:14,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 1388 flow, removed 45 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:14,851 INFO L231 Difference]: Finished difference. Result has 71 places, 98 transitions, 1150 flow [2022-12-13 11:11:14,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=71, PETRI_TRANSITIONS=98} [2022-12-13 11:11:14,852 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-13 11:11:14,852 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:14,852 INFO L89 Accepts]: Start accepts. Operand has 71 places, 98 transitions, 1150 flow [2022-12-13 11:11:14,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:14,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:14,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 98 transitions, 1150 flow [2022-12-13 11:11:14,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 98 transitions, 1150 flow [2022-12-13 11:11:14,882 INFO L130 PetriNetUnfolder]: 72/282 cut-off events. [2022-12-13 11:11:14,882 INFO L131 PetriNetUnfolder]: For 928/960 co-relation queries the response was YES. [2022-12-13 11:11:14,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 282 events. 72/282 cut-off events. For 928/960 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1742 event pairs, 4 based on Foata normal form. 6/280 useless extension candidates. Maximal degree in co-relation 1165. Up to 83 conditions per place. [2022-12-13 11:11:14,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 98 transitions, 1150 flow [2022-12-13 11:11:14,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-13 11:11:14,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [637] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_221| v_~f~0.base_138))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_138 (* v_~x1~0_218 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_138 (* v_~x2~0_146 4)))) (.cse3 (select .cse2 (+ v_~f~0.offset_138 (* .cse0 4))))) (and (< 2 (* (mod v_~n~0_146 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_175| 3) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_119| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_146)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_109|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_146)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_119|) (= v_~x2~0_145 (select .cse2 (+ v_~f~0.offset_138 (* .cse1 4)))) (= v_~x1~0_216 (select .cse2 (+ v_~f~0.offset_138 (* .cse3 4)))) (not (= (ite (and (<= 0 v_~x2~0_146) (< v_~x2~0_146 v_~size~0_146)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_146)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (not (= (ite (and (< v_~x1~0_218 v_~size~0_146) (<= 0 v_~x1~0_218)) 1 0) 0)))))) InVars {~x2~0=v_~x2~0_146, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_138, #memory_int=|v_#memory_int_221|, ~n~0=v_~n~0_146, ~x1~0=v_~x1~0_218, ~f~0.offset=v_~f~0.offset_138} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_121|, ~x2~0=v_~x2~0_145, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_60|, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_138, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_64|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~x1~0=v_~x1~0_216, ~f~0.offset=v_~f~0.offset_138, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_119|, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_50|, ~n~0=v_~n~0_146, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_129|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_50|} 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 11:11:15,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:11:15,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-13 11:11:15,317 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 98 transitions, 1158 flow [2022-12-13 11:11:15,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:15,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:15,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:15,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:11:15,317 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 11:11:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2110913378, now seen corresponding path program 1 times [2022-12-13 11:11:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:15,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613699098] [2022-12-13 11:11:15,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:15,404 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 11:11:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:15,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613699098] [2022-12-13 11:11:15,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613699098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:15,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:15,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577115591] [2022-12-13 11:11:15,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:15,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:11:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:11:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:11:15,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 11:11:15,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 98 transitions, 1158 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 11:11:15,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:15,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 11:11:15,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:15,587 INFO L130 PetriNetUnfolder]: 455/826 cut-off events. [2022-12-13 11:11:15,587 INFO L131 PetriNetUnfolder]: For 4009/4009 co-relation queries the response was YES. [2022-12-13 11:11:15,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 826 events. 455/826 cut-off events. For 4009/4009 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4009 event pairs, 215 based on Foata normal form. 18/836 useless extension candidates. Maximal degree in co-relation 4175. Up to 788 conditions per place. [2022-12-13 11:11:15,595 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 94 selfloop transitions, 8 changer transitions 1/103 dead transitions. [2022-12-13 11:11:15,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 1397 flow [2022-12-13 11:11:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:11:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:11:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 11:11:15,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3963963963963964 [2022-12-13 11:11:15,596 INFO L175 Difference]: Start difference. First operand has 70 places, 98 transitions, 1158 flow. Second operand 3 states and 44 transitions. [2022-12-13 11:11:15,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 1397 flow [2022-12-13 11:11:15,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 103 transitions, 1341 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:15,612 INFO L231 Difference]: Finished difference. Result has 71 places, 98 transitions, 1128 flow [2022-12-13 11:11:15,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=71, PETRI_TRANSITIONS=98} [2022-12-13 11:11:15,612 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-13 11:11:15,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:15,612 INFO L89 Accepts]: Start accepts. Operand has 71 places, 98 transitions, 1128 flow [2022-12-13 11:11:15,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:15,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:15,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 98 transitions, 1128 flow [2022-12-13 11:11:15,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 98 transitions, 1128 flow [2022-12-13 11:11:15,644 INFO L130 PetriNetUnfolder]: 72/271 cut-off events. [2022-12-13 11:11:15,644 INFO L131 PetriNetUnfolder]: For 986/1010 co-relation queries the response was YES. [2022-12-13 11:11:15,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 271 events. 72/271 cut-off events. For 986/1010 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1625 event pairs, 4 based on Foata normal form. 6/272 useless extension candidates. Maximal degree in co-relation 1089. Up to 76 conditions per place. [2022-12-13 11:11:15,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 98 transitions, 1128 flow [2022-12-13 11:11:15,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-13 11:11:15,648 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:15,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 11:11:15,649 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 98 transitions, 1128 flow [2022-12-13 11:11:15,649 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 11:11:15,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:15,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:15,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:11:15,649 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 11:11:15,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 426309191, now seen corresponding path program 1 times [2022-12-13 11:11:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:15,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325054503] [2022-12-13 11:11:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:16,098 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 11:11:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:16,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325054503] [2022-12-13 11:11:16,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325054503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:16,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:16,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:11:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370294536] [2022-12-13 11:11:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:16,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 11:11:16,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 98 transitions, 1128 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 11:11:16,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:16,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 11:11:16,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:16,377 INFO L130 PetriNetUnfolder]: 521/939 cut-off events. [2022-12-13 11:11:16,377 INFO L131 PetriNetUnfolder]: For 4380/4380 co-relation queries the response was YES. [2022-12-13 11:11:16,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4836 conditions, 939 events. 521/939 cut-off events. For 4380/4380 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4701 event pairs, 103 based on Foata normal form. 1/928 useless extension candidates. Maximal degree in co-relation 4616. Up to 749 conditions per place. [2022-12-13 11:11:16,386 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 84 selfloop transitions, 38 changer transitions 1/123 dead transitions. [2022-12-13 11:11:16,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 123 transitions, 1561 flow [2022-12-13 11:11:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:11:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:11:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 11:11:16,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34054054054054056 [2022-12-13 11:11:16,388 INFO L175 Difference]: Start difference. First operand has 71 places, 98 transitions, 1128 flow. Second operand 5 states and 63 transitions. [2022-12-13 11:11:16,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 123 transitions, 1561 flow [2022-12-13 11:11:16,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 123 transitions, 1545 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:16,403 INFO L231 Difference]: Finished difference. Result has 75 places, 108 transitions, 1381 flow [2022-12-13 11:11:16,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1381, PETRI_PLACES=75, PETRI_TRANSITIONS=108} [2022-12-13 11:11:16,404 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-13 11:11:16,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:16,404 INFO L89 Accepts]: Start accepts. Operand has 75 places, 108 transitions, 1381 flow [2022-12-13 11:11:16,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:16,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:16,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 108 transitions, 1381 flow [2022-12-13 11:11:16,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 108 transitions, 1381 flow [2022-12-13 11:11:16,446 INFO L130 PetriNetUnfolder]: 80/292 cut-off events. [2022-12-13 11:11:16,446 INFO L131 PetriNetUnfolder]: For 1386/1421 co-relation queries the response was YES. [2022-12-13 11:11:16,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 292 events. 80/292 cut-off events. For 1386/1421 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1783 event pairs, 4 based on Foata normal form. 8/293 useless extension candidates. Maximal degree in co-relation 1293. Up to 83 conditions per place. [2022-12-13 11:11:16,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 108 transitions, 1381 flow [2022-12-13 11:11:16,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-13 11:11:16,451 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:16,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 11:11:16,454 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 108 transitions, 1381 flow [2022-12-13 11:11:16,454 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 11:11:16,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:16,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:16,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:11:16,455 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 11:11:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1058375077, now seen corresponding path program 1 times [2022-12-13 11:11:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:16,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051791263] [2022-12-13 11:11:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:16,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:16,530 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 11:11:16,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:16,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051791263] [2022-12-13 11:11:16,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051791263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:16,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:16,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:11:16,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936821099] [2022-12-13 11:11:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:16,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:16,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 11:11:16,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 108 transitions, 1381 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 11:11:16,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:16,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 11:11:16,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:16,801 INFO L130 PetriNetUnfolder]: 585/1102 cut-off events. [2022-12-13 11:11:16,801 INFO L131 PetriNetUnfolder]: For 6618/6618 co-relation queries the response was YES. [2022-12-13 11:11:16,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5808 conditions, 1102 events. 585/1102 cut-off events. For 6618/6618 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6107 event pairs, 131 based on Foata normal form. 28/1114 useless extension candidates. Maximal degree in co-relation 5559. Up to 635 conditions per place. [2022-12-13 11:11:16,811 INFO L137 encePairwiseOnDemand]: 24/37 looper letters, 114 selfloop transitions, 31 changer transitions 7/152 dead transitions. [2022-12-13 11:11:16,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 152 transitions, 2117 flow [2022-12-13 11:11:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:11:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:11:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 11:11:16,813 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34594594594594597 [2022-12-13 11:11:16,813 INFO L175 Difference]: Start difference. First operand has 75 places, 108 transitions, 1381 flow. Second operand 5 states and 64 transitions. [2022-12-13 11:11:16,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 152 transitions, 2117 flow [2022-12-13 11:11:16,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 2080 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:16,835 INFO L231 Difference]: Finished difference. Result has 80 places, 114 transitions, 1558 flow [2022-12-13 11:11:16,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1558, PETRI_PLACES=80, PETRI_TRANSITIONS=114} [2022-12-13 11:11:16,835 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 59 predicate places. [2022-12-13 11:11:16,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:16,836 INFO L89 Accepts]: Start accepts. Operand has 80 places, 114 transitions, 1558 flow [2022-12-13 11:11:16,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:16,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:16,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 114 transitions, 1558 flow [2022-12-13 11:11:16,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 114 transitions, 1558 flow [2022-12-13 11:11:16,878 INFO L130 PetriNetUnfolder]: 86/330 cut-off events. [2022-12-13 11:11:16,878 INFO L131 PetriNetUnfolder]: For 1885/1924 co-relation queries the response was YES. [2022-12-13 11:11:16,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 330 events. 86/330 cut-off events. For 1885/1924 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2147 event pairs, 4 based on Foata normal form. 10/331 useless extension candidates. Maximal degree in co-relation 1509. Up to 95 conditions per place. [2022-12-13 11:11:16,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 114 transitions, 1558 flow [2022-12-13 11:11:16,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-13 11:11:16,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_183| v_~f~0.base_110))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_110 (* v_~x1~0_152 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (< .cse0 v_~size~0_120) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (select .cse1 (+ v_~f~0.offset_110 (* .cse0 4))) v_~x1~0_150) (not (= (ite (and (< v_~x1~0_152 v_~size~0_120) (<= 0 v_~x1~0_152)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_132| 2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_132| 4294967295) 4294967296) (* (mod v_~n~0_120 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0))))) InVars {~size~0=v_~size~0_120, ~f~0.base=v_~f~0.base_110, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_120, ~x1~0=v_~x1~0_152, ~f~0.offset=v_~f~0.offset_110} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, ~size~0=v_~size~0_120, ~f~0.base=v_~f~0.base_110, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_132|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_120, ~x1~0=v_~x1~0_150, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ~f~0.offset=v_~f~0.offset_110} AuxVars[] 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 11:11:17,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:11:17,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-13 11:11:17,105 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 114 transitions, 1567 flow [2022-12-13 11:11:17,105 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 11:11:17,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:17,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:17,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:11:17,106 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 11:11:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 369625341, now seen corresponding path program 1 times [2022-12-13 11:11:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:17,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791313283] [2022-12-13 11:11:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:17,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:17,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791313283] [2022-12-13 11:11:17,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791313283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:17,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:17,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:11:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023654158] [2022-12-13 11:11:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:17,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:17,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 11:11:17,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 114 transitions, 1567 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 11:11:17,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:17,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 11:11:17,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:18,009 INFO L130 PetriNetUnfolder]: 577/1070 cut-off events. [2022-12-13 11:11:18,009 INFO L131 PetriNetUnfolder]: For 7750/7750 co-relation queries the response was YES. [2022-12-13 11:11:18,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6267 conditions, 1070 events. 577/1070 cut-off events. For 7750/7750 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5692 event pairs, 128 based on Foata normal form. 2/1056 useless extension candidates. Maximal degree in co-relation 6022. Up to 800 conditions per place. [2022-12-13 11:11:18,020 INFO L137 encePairwiseOnDemand]: 15/38 looper letters, 79 selfloop transitions, 51 changer transitions 5/135 dead transitions. [2022-12-13 11:11:18,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 1994 flow [2022-12-13 11:11:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:11:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:11:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-13 11:11:18,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35789473684210527 [2022-12-13 11:11:18,022 INFO L175 Difference]: Start difference. First operand has 80 places, 114 transitions, 1567 flow. Second operand 5 states and 68 transitions. [2022-12-13 11:11:18,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 1994 flow [2022-12-13 11:11:18,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 1838 flow, removed 62 selfloop flow, removed 1 redundant places. [2022-12-13 11:11:18,042 INFO L231 Difference]: Finished difference. Result has 85 places, 118 transitions, 1658 flow [2022-12-13 11:11:18,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1658, PETRI_PLACES=85, PETRI_TRANSITIONS=118} [2022-12-13 11:11:18,042 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 64 predicate places. [2022-12-13 11:11:18,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:18,043 INFO L89 Accepts]: Start accepts. Operand has 85 places, 118 transitions, 1658 flow [2022-12-13 11:11:18,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:18,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:18,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 118 transitions, 1658 flow [2022-12-13 11:11:18,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 118 transitions, 1658 flow [2022-12-13 11:11:18,083 INFO L130 PetriNetUnfolder]: 89/342 cut-off events. [2022-12-13 11:11:18,083 INFO L131 PetriNetUnfolder]: For 2187/2225 co-relation queries the response was YES. [2022-12-13 11:11:18,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1718 conditions, 342 events. 89/342 cut-off events. For 2187/2225 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2264 event pairs, 4 based on Foata normal form. 15/348 useless extension candidates. Maximal degree in co-relation 1609. Up to 96 conditions per place. [2022-12-13 11:11:18,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 118 transitions, 1658 flow [2022-12-13 11:11:18,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-13 11:11:18,089 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:18,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 11:11:18,090 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 118 transitions, 1658 flow [2022-12-13 11:11:18,090 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 11:11:18,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:18,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:18,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 11:11:18,090 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 11:11:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash -203142674, now seen corresponding path program 1 times [2022-12-13 11:11:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:18,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889503642] [2022-12-13 11:11:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,170 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 11:11:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889503642] [2022-12-13 11:11:18,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889503642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775694022] [2022-12-13 11:11:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:18,172 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 11:11:18,200 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 11:11:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:11:18,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:18,295 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 11:11:18,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:18,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775694022] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:18,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:18,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-13 11:11:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001252926] [2022-12-13 11:11:18,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:18,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:18,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 11:11:18,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 118 transitions, 1658 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 11:11:18,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:18,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 11:11:18,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:18,743 INFO L130 PetriNetUnfolder]: 661/1218 cut-off events. [2022-12-13 11:11:18,743 INFO L131 PetriNetUnfolder]: For 8948/8948 co-relation queries the response was YES. [2022-12-13 11:11:18,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7046 conditions, 1218 events. 661/1218 cut-off events. For 8948/8948 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6679 event pairs, 158 based on Foata normal form. 14/1216 useless extension candidates. Maximal degree in co-relation 6633. Up to 573 conditions per place. [2022-12-13 11:11:18,756 INFO L137 encePairwiseOnDemand]: 18/38 looper letters, 117 selfloop transitions, 45 changer transitions 0/162 dead transitions. [2022-12-13 11:11:18,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 162 transitions, 2439 flow [2022-12-13 11:11:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:11:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:11:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-13 11:11:18,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30451127819548873 [2022-12-13 11:11:18,758 INFO L175 Difference]: Start difference. First operand has 85 places, 118 transitions, 1658 flow. Second operand 7 states and 81 transitions. [2022-12-13 11:11:18,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 162 transitions, 2439 flow [2022-12-13 11:11:18,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 162 transitions, 2405 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 11:11:18,783 INFO L231 Difference]: Finished difference. Result has 94 places, 122 transitions, 1831 flow [2022-12-13 11:11:18,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1831, PETRI_PLACES=94, PETRI_TRANSITIONS=122} [2022-12-13 11:11:18,784 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-13 11:11:18,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:18,785 INFO L89 Accepts]: Start accepts. Operand has 94 places, 122 transitions, 1831 flow [2022-12-13 11:11:18,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:18,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:18,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 122 transitions, 1831 flow [2022-12-13 11:11:18,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 122 transitions, 1831 flow [2022-12-13 11:11:18,836 INFO L130 PetriNetUnfolder]: 107/405 cut-off events. [2022-12-13 11:11:18,836 INFO L131 PetriNetUnfolder]: For 3193/3253 co-relation queries the response was YES. [2022-12-13 11:11:18,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 405 events. 107/405 cut-off events. For 3193/3253 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2820 event pairs, 7 based on Foata normal form. 15/408 useless extension candidates. Maximal degree in co-relation 2008. Up to 119 conditions per place. [2022-12-13 11:11:18,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 122 transitions, 1831 flow [2022-12-13 11:11:18,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-13 11:11:18,854 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 [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 11:11:19,048 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 [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 11:11:19,236 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 [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 11:11:19,403 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 [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 11:11:19,551 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 [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 11:11:19,726 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 [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 11:11:19,916 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 [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 11:11:20,112 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 [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 11:11:20,271 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:11:20,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1491 [2022-12-13 11:11:20,275 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 124 transitions, 1963 flow [2022-12-13 11:11:20,275 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 11:11:20,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:20,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:20,283 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 11:11:20,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:20,482 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 11:11:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash 982496772, now seen corresponding path program 1 times [2022-12-13 11:11:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:20,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928094278] [2022-12-13 11:11:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:21,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928094278] [2022-12-13 11:11:21,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928094278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:21,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:21,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:11:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197135793] [2022-12-13 11:11:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:21,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:21,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 11:11:21,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 124 transitions, 1963 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 11:11:21,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:21,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 11:11:21,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:21,479 INFO L130 PetriNetUnfolder]: 761/1431 cut-off events. [2022-12-13 11:11:21,480 INFO L131 PetriNetUnfolder]: For 12568/12568 co-relation queries the response was YES. [2022-12-13 11:11:21,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8640 conditions, 1431 events. 761/1431 cut-off events. For 12568/12568 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8265 event pairs, 389 based on Foata normal form. 1/1416 useless extension candidates. Maximal degree in co-relation 7871. Up to 1320 conditions per place. [2022-12-13 11:11:21,502 INFO L137 encePairwiseOnDemand]: 23/46 looper letters, 91 selfloop transitions, 34 changer transitions 8/133 dead transitions. [2022-12-13 11:11:21,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 2101 flow [2022-12-13 11:11:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:11:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-13 11:11:21,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2318840579710145 [2022-12-13 11:11:21,504 INFO L175 Difference]: Start difference. First operand has 95 places, 124 transitions, 1963 flow. Second operand 6 states and 64 transitions. [2022-12-13 11:11:21,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 2101 flow [2022-12-13 11:11:21,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 133 transitions, 2068 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:21,536 INFO L231 Difference]: Finished difference. Result has 100 places, 113 transitions, 1742 flow [2022-12-13 11:11:21,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1742, PETRI_PLACES=100, PETRI_TRANSITIONS=113} [2022-12-13 11:11:21,537 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-13 11:11:21,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:21,537 INFO L89 Accepts]: Start accepts. Operand has 100 places, 113 transitions, 1742 flow [2022-12-13 11:11:21,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:21,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:21,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 113 transitions, 1742 flow [2022-12-13 11:11:21,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 113 transitions, 1742 flow [2022-12-13 11:11:21,603 INFO L130 PetriNetUnfolder]: 108/450 cut-off events. [2022-12-13 11:11:21,603 INFO L131 PetriNetUnfolder]: For 3494/3561 co-relation queries the response was YES. [2022-12-13 11:11:21,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 450 events. 108/450 cut-off events. For 3494/3561 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3286 event pairs, 11 based on Foata normal form. 15/452 useless extension candidates. Maximal degree in co-relation 2252. Up to 137 conditions per place. [2022-12-13 11:11:21,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 113 transitions, 1742 flow [2022-12-13 11:11:21,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 11:11:21,610 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:21,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 11:11:21,610 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 113 transitions, 1742 flow [2022-12-13 11:11:21,610 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 11:11:21,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:21,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:21,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 11:11:21,611 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 11:11:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -344551452, now seen corresponding path program 1 times [2022-12-13 11:11:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:21,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780295825] [2022-12-13 11:11:21,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,686 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 11:11:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:21,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780295825] [2022-12-13 11:11:21,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780295825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:21,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:21,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:11:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29919647] [2022-12-13 11:11:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:21,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:21,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 11:11:21,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 113 transitions, 1742 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 11:11:21,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:21,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 11:11:21,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:22,013 INFO L130 PetriNetUnfolder]: 679/1341 cut-off events. [2022-12-13 11:11:22,014 INFO L131 PetriNetUnfolder]: For 13459/13459 co-relation queries the response was YES. [2022-12-13 11:11:22,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1341 events. 679/1341 cut-off events. For 13459/13459 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7999 event pairs, 296 based on Foata normal form. 62/1393 useless extension candidates. Maximal degree in co-relation 7460. Up to 934 conditions per place. [2022-12-13 11:11:22,026 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 87 selfloop transitions, 49 changer transitions 0/136 dead transitions. [2022-12-13 11:11:22,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 136 transitions, 2204 flow [2022-12-13 11:11:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:11:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:11:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-13 11:11:22,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3631578947368421 [2022-12-13 11:11:22,028 INFO L175 Difference]: Start difference. First operand has 100 places, 113 transitions, 1742 flow. Second operand 5 states and 69 transitions. [2022-12-13 11:11:22,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 136 transitions, 2204 flow [2022-12-13 11:11:22,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 2131 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-13 11:11:22,068 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 1898 flow [2022-12-13 11:11:22,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1898, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2022-12-13 11:11:22,069 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 81 predicate places. [2022-12-13 11:11:22,069 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:22,069 INFO L89 Accepts]: Start accepts. Operand has 102 places, 118 transitions, 1898 flow [2022-12-13 11:11:22,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:22,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:22,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 118 transitions, 1898 flow [2022-12-13 11:11:22,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 118 transitions, 1898 flow [2022-12-13 11:11:22,127 INFO L130 PetriNetUnfolder]: 119/485 cut-off events. [2022-12-13 11:11:22,127 INFO L131 PetriNetUnfolder]: For 3887/3934 co-relation queries the response was YES. [2022-12-13 11:11:22,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 485 events. 119/485 cut-off events. For 3887/3934 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3592 event pairs, 12 based on Foata normal form. 9/479 useless extension candidates. Maximal degree in co-relation 2505. Up to 155 conditions per place. [2022-12-13 11:11:22,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 118 transitions, 1898 flow [2022-12-13 11:11:22,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-13 11:11:22,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (* (mod v_~n~0_104 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_116 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 2) |v_thread1Thread1of1ForFork0_~i~0#1_106|) (= v_~x1~0_114 (select .cse1 (+ (* .cse2 4) v_~f~0.offset_92))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 1) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_116 v_~size~0_104) (<= 0 v_~x1~0_116)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_104)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|)))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_116, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_60|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_114, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_68|, ~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 [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 11:11:22,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (* (mod v_~n~0_104 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_116 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 2) |v_thread1Thread1of1ForFork0_~i~0#1_106|) (= v_~x1~0_114 (select .cse1 (+ (* .cse2 4) v_~f~0.offset_92))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 1) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_116 v_~size~0_104) (<= 0 v_~x1~0_116)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_104)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|)))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_116, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_60|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_114, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_68|, ~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 [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 11:11:22,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (* (mod v_~n~0_104 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_116 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 2) |v_thread1Thread1of1ForFork0_~i~0#1_106|) (= v_~x1~0_114 (select .cse1 (+ (* .cse2 4) v_~f~0.offset_92))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 1) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_116 v_~size~0_104) (<= 0 v_~x1~0_116)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_104)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|)))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_116, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_60|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_114, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_68|, ~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 [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 11:11:22,774 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 11:11:22,934 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 11:11:23,089 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 11:11:23,254 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 11:11:23,366 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:11:23,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1298 [2022-12-13 11:11:23,367 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 121 transitions, 1982 flow [2022-12-13 11:11:23,367 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 11:11:23,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:23,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:23,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 11:11:23,368 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 11:11:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1541773989, now seen corresponding path program 2 times [2022-12-13 11:11:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:23,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220150377] [2022-12-13 11:11:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:23,445 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 11:11:23,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:23,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220150377] [2022-12-13 11:11:23,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220150377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:23,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:23,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:11:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794379454] [2022-12-13 11:11:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:23,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:23,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 11:11:23,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 121 transitions, 1982 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 11:11:23,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:23,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 11:11:23,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:23,812 INFO L130 PetriNetUnfolder]: 691/1436 cut-off events. [2022-12-13 11:11:23,812 INFO L131 PetriNetUnfolder]: For 11662/11662 co-relation queries the response was YES. [2022-12-13 11:11:23,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8585 conditions, 1436 events. 691/1436 cut-off events. For 11662/11662 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9164 event pairs, 324 based on Foata normal form. 4/1422 useless extension candidates. Maximal degree in co-relation 7936. Up to 982 conditions per place. [2022-12-13 11:11:23,824 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 89 selfloop transitions, 50 changer transitions 0/139 dead transitions. [2022-12-13 11:11:23,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 139 transitions, 2411 flow [2022-12-13 11:11:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:11:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:11:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-13 11:11:23,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31555555555555553 [2022-12-13 11:11:23,825 INFO L175 Difference]: Start difference. First operand has 105 places, 121 transitions, 1982 flow. Second operand 5 states and 71 transitions. [2022-12-13 11:11:23,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 139 transitions, 2411 flow [2022-12-13 11:11:23,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 2289 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:23,865 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 1975 flow [2022-12-13 11:11:23,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1975, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2022-12-13 11:11:23,865 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 87 predicate places. [2022-12-13 11:11:23,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:23,866 INFO L89 Accepts]: Start accepts. Operand has 108 places, 121 transitions, 1975 flow [2022-12-13 11:11:23,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:23,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:23,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 121 transitions, 1975 flow [2022-12-13 11:11:23,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 121 transitions, 1975 flow [2022-12-13 11:11:23,928 INFO L130 PetriNetUnfolder]: 112/536 cut-off events. [2022-12-13 11:11:23,928 INFO L131 PetriNetUnfolder]: For 4006/4058 co-relation queries the response was YES. [2022-12-13 11:11:23,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 536 events. 112/536 cut-off events. For 4006/4058 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4308 event pairs, 12 based on Foata normal form. 10/531 useless extension candidates. Maximal degree in co-relation 2584. Up to 144 conditions per place. [2022-12-13 11:11:23,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 121 transitions, 1975 flow [2022-12-13 11:11:23,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 11:11:23,935 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:23,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 11:11:23,936 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 1975 flow [2022-12-13 11:11:23,936 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 11:11:23,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:23,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:23,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 11:11:23,937 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 11:11:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:23,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1770749379, now seen corresponding path program 1 times [2022-12-13 11:11:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:23,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158589336] [2022-12-13 11:11:23,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,005 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 11:11:24,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158589336] [2022-12-13 11:11:24,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158589336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476572317] [2022-12-13 11:11:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:24,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:24,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:24,008 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 11:11:24,031 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 11:11:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:11:24,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:24,125 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 11:11:24,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:24,164 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 11:11:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476572317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:24,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:24,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 11:11:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624772980] [2022-12-13 11:11:24,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:11:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:11:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:24,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 11:11:24,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 1975 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 11:11:24,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:24,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 11:11:24,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:24,731 INFO L130 PetriNetUnfolder]: 771/1593 cut-off events. [2022-12-13 11:11:24,732 INFO L131 PetriNetUnfolder]: For 15474/15474 co-relation queries the response was YES. [2022-12-13 11:11:24,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9719 conditions, 1593 events. 771/1593 cut-off events. For 15474/15474 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10271 event pairs, 238 based on Foata normal form. 72/1639 useless extension candidates. Maximal degree in co-relation 9054. Up to 729 conditions per place. [2022-12-13 11:11:24,744 INFO L137 encePairwiseOnDemand]: 20/44 looper letters, 116 selfloop transitions, 65 changer transitions 3/184 dead transitions. [2022-12-13 11:11:24,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 184 transitions, 2975 flow [2022-12-13 11:11:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:11:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:11:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 11:11:24,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-13 11:11:24,746 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 1975 flow. Second operand 8 states and 104 transitions. [2022-12-13 11:11:24,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 184 transitions, 2975 flow [2022-12-13 11:11:24,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 184 transitions, 2863 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 11:11:24,786 INFO L231 Difference]: Finished difference. Result has 114 places, 129 transitions, 2153 flow [2022-12-13 11:11:24,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2153, PETRI_PLACES=114, PETRI_TRANSITIONS=129} [2022-12-13 11:11:24,786 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-13 11:11:24,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:24,786 INFO L89 Accepts]: Start accepts. Operand has 114 places, 129 transitions, 2153 flow [2022-12-13 11:11:24,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:24,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:24,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 129 transitions, 2153 flow [2022-12-13 11:11:24,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 129 transitions, 2153 flow [2022-12-13 11:11:24,852 INFO L130 PetriNetUnfolder]: 122/597 cut-off events. [2022-12-13 11:11:24,853 INFO L131 PetriNetUnfolder]: For 4841/4901 co-relation queries the response was YES. [2022-12-13 11:11:24,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 597 events. 122/597 cut-off events. For 4841/4901 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4950 event pairs, 13 based on Foata normal form. 10/595 useless extension candidates. Maximal degree in co-relation 2961. Up to 156 conditions per place. [2022-12-13 11:11:24,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 129 transitions, 2153 flow [2022-12-13 11:11:24,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 11:11:24,861 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:24,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 11:11:24,862 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 129 transitions, 2153 flow [2022-12-13 11:11:24,862 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 11:11:24,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:24,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:24,871 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 11:11:25,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:25,069 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 11:11:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash -145134106, now seen corresponding path program 1 times [2022-12-13 11:11:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:25,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789588604] [2022-12-13 11:11:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,168 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 11:11:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:25,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789588604] [2022-12-13 11:11:25,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789588604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:25,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133357462] [2022-12-13 11:11:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:25,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:25,172 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 11:11:25,195 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 11:11:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 11:11:25,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:25,350 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 11:11:25,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:25,477 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 11:11:25,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133357462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:25,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:25,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 9 [2022-12-13 11:11:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034789489] [2022-12-13 11:11:25,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:25,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:11:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:11:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:11:25,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 11:11:25,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 129 transitions, 2153 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:25,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:25,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 11:11:25,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:26,760 INFO L130 PetriNetUnfolder]: 947/1945 cut-off events. [2022-12-13 11:11:26,760 INFO L131 PetriNetUnfolder]: For 23041/23041 co-relation queries the response was YES. [2022-12-13 11:11:26,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12812 conditions, 1945 events. 947/1945 cut-off events. For 23041/23041 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13132 event pairs, 363 based on Foata normal form. 20/1941 useless extension candidates. Maximal degree in co-relation 11789. Up to 1500 conditions per place. [2022-12-13 11:11:26,777 INFO L137 encePairwiseOnDemand]: 21/44 looper letters, 121 selfloop transitions, 74 changer transitions 5/200 dead transitions. [2022-12-13 11:11:26,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 200 transitions, 3425 flow [2022-12-13 11:11:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:11:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 11:11:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-13 11:11:26,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21136363636363636 [2022-12-13 11:11:26,779 INFO L175 Difference]: Start difference. First operand has 112 places, 129 transitions, 2153 flow. Second operand 10 states and 93 transitions. [2022-12-13 11:11:26,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 200 transitions, 3425 flow [2022-12-13 11:11:26,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 200 transitions, 3223 flow, removed 57 selfloop flow, removed 3 redundant places. [2022-12-13 11:11:26,840 INFO L231 Difference]: Finished difference. Result has 124 places, 171 transitions, 2922 flow [2022-12-13 11:11:26,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2922, PETRI_PLACES=124, PETRI_TRANSITIONS=171} [2022-12-13 11:11:26,840 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-13 11:11:26,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:26,841 INFO L89 Accepts]: Start accepts. Operand has 124 places, 171 transitions, 2922 flow [2022-12-13 11:11:26,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:26,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:26,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 171 transitions, 2922 flow [2022-12-13 11:11:26,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 171 transitions, 2922 flow [2022-12-13 11:11:26,941 INFO L130 PetriNetUnfolder]: 173/783 cut-off events. [2022-12-13 11:11:26,941 INFO L131 PetriNetUnfolder]: For 8522/8592 co-relation queries the response was YES. [2022-12-13 11:11:26,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4819 conditions, 783 events. 173/783 cut-off events. For 8522/8592 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6840 event pairs, 20 based on Foata normal form. 4/772 useless extension candidates. Maximal degree in co-relation 4370. Up to 229 conditions per place. [2022-12-13 11:11:26,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 171 transitions, 2922 flow [2022-12-13 11:11:26,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 11:11:26,965 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 11:11:28,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse5 (select |v_#memory_int_277| v_~f~0.base_190))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_190 (* v_~x1~0_318 4))))) (let ((.cse2 (select .cse5 (+ (* .cse4 4) v_~f~0.offset_190)))) (let ((.cse0 (* 2 (mod v_~n~0_198 2147483648))) (.cse3 (select .cse5 (+ v_~f~0.offset_190 (* .cse2 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_190 (* v_~x2~0_265 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_265| 4294967296) .cse0)) (= (ite (and (< .cse1 v_~size~0_198) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_145|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_31| 0) (not (= (ite (and (<= 0 v_~x1~0_318) (< v_~x1~0_318 v_~size~0_198)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_31| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_198)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_265) (< v_~x2~0_265 v_~size~0_198)) 1 0))) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_198)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|) (< 2 .cse0) (not (= 0 (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_198)) 1 0))) (= v_~x1~0_316 (select .cse5 (+ v_~f~0.offset_190 (* .cse3 4)))) (= v_~x2~0_264 (select .cse5 (+ v_~f~0.offset_190 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_265| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_145| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_202|)))))) InVars {~x2~0=v_~x2~0_265, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_190, #memory_int=|v_#memory_int_277|, ~n~0=v_~n~0_198, ~x1~0=v_~x1~0_318, ~f~0.offset=v_~f~0.offset_190} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_178|, ~x2~0=v_~x2~0_264, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_131|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_31|, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_190, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_135|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_202|, ~x1~0=v_~x1~0_316, ~f~0.offset=v_~f~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_265|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, #memory_int=|v_#memory_int_277|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_121|, ~n~0=v_~n~0_198, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_186|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_121|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 11:11:29,048 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:11:29,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2208 [2022-12-13 11:11:29,049 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 171 transitions, 2995 flow [2022-12-13 11:11:29,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:29,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:29,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:29,056 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 11:11:29,251 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,SelfDestructingSolverStorable25 [2022-12-13 11:11:29,251 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 11:11:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash 5580133, now seen corresponding path program 1 times [2022-12-13 11:11:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:29,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475802486] [2022-12-13 11:11:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:29,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:29,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475802486] [2022-12-13 11:11:29,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475802486] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:29,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51644920] [2022-12-13 11:11:29,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:29,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:29,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:29,340 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 11:11:29,343 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 11:11:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:29,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 11:11:29,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:29,673 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 11:11:29,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:29,795 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 11:11:29,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51644920] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:29,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:29,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2022-12-13 11:11:29,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142633673] [2022-12-13 11:11:29,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:29,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:11:29,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:11:29,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:29,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 11:11:29,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 171 transitions, 2995 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 11:11:29,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:29,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 11:11:29,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:30,783 INFO L130 PetriNetUnfolder]: 1011/2058 cut-off events. [2022-12-13 11:11:30,783 INFO L131 PetriNetUnfolder]: For 30702/30702 co-relation queries the response was YES. [2022-12-13 11:11:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15150 conditions, 2058 events. 1011/2058 cut-off events. For 30702/30702 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13970 event pairs, 370 based on Foata normal form. 20/2062 useless extension candidates. Maximal degree in co-relation 14038. Up to 1609 conditions per place. [2022-12-13 11:11:30,808 INFO L137 encePairwiseOnDemand]: 21/47 looper letters, 141 selfloop transitions, 70 changer transitions 10/221 dead transitions. [2022-12-13 11:11:30,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 221 transitions, 4090 flow [2022-12-13 11:11:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:11:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 11:11:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2022-12-13 11:11:30,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19922630560928434 [2022-12-13 11:11:30,810 INFO L175 Difference]: Start difference. First operand has 124 places, 171 transitions, 2995 flow. Second operand 11 states and 103 transitions. [2022-12-13 11:11:30,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 221 transitions, 4090 flow [2022-12-13 11:11:30,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 221 transitions, 3904 flow, removed 92 selfloop flow, removed 1 redundant places. [2022-12-13 11:11:30,913 INFO L231 Difference]: Finished difference. Result has 139 places, 187 transitions, 3427 flow [2022-12-13 11:11:30,914 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2771, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3427, PETRI_PLACES=139, PETRI_TRANSITIONS=187} [2022-12-13 11:11:30,914 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 118 predicate places. [2022-12-13 11:11:30,914 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:30,914 INFO L89 Accepts]: Start accepts. Operand has 139 places, 187 transitions, 3427 flow [2022-12-13 11:11:30,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:30,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:30,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 187 transitions, 3427 flow [2022-12-13 11:11:30,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 187 transitions, 3427 flow [2022-12-13 11:11:31,031 INFO L130 PetriNetUnfolder]: 194/828 cut-off events. [2022-12-13 11:11:31,031 INFO L131 PetriNetUnfolder]: For 11469/11555 co-relation queries the response was YES. [2022-12-13 11:11:31,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 828 events. 194/828 cut-off events. For 11469/11555 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7212 event pairs, 20 based on Foata normal form. 5/814 useless extension candidates. Maximal degree in co-relation 5077. Up to 262 conditions per place. [2022-12-13 11:11:31,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 187 transitions, 3427 flow [2022-12-13 11:11:31,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-13 11:11:31,055 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 [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 11:11:31,188 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 [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 11:11:31,300 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 [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 11:11:31,414 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 [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 11:11:31,583 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 [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 11:11:31,721 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 [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 11:11:31,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_159| v_~f~0.base_94))) (let ((.cse2 (select .cse1 (+ (* v_~x1~0_122 4) v_~f~0.offset_94)))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_94 (* .cse2 4)))) (.cse3 (* (mod v_~n~0_106 2147483648) 2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= v_~x1~0_120 (select .cse1 (+ v_~f~0.offset_94 (* .cse0 4)))) (not (= (ite (and (< .cse2 v_~size~0_106) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_122) (< v_~x1~0_122 v_~size~0_106)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 2) 4294967296) .cse3) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967296) .cse3) (= |v_thread1Thread1of1ForFork0_~i~0#1_112| (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 3)))))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_122, ~f~0.offset=v_~f~0.offset_94} 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_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_120, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_94} AuxVars[] 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 11:11:32,432 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:11:32,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1519 [2022-12-13 11:11:32,433 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 186 transitions, 3540 flow [2022-12-13 11:11:32,433 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 11:11:32,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:32,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:32,443 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 11:11:32,634 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,SelfDestructingSolverStorable26 [2022-12-13 11:11:32,634 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 11:11:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1805590497, now seen corresponding path program 1 times [2022-12-13 11:11:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977900213] [2022-12-13 11:11:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:32,709 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 11:11:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:32,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977900213] [2022-12-13 11:11:32,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977900213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:32,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:32,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679306313] [2022-12-13 11:11:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:32,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:11:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:11:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:11:32,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 11:11:32,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 186 transitions, 3540 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:32,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:32,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 11:11:32,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:33,242 INFO L130 PetriNetUnfolder]: 992/2030 cut-off events. [2022-12-13 11:11:33,243 INFO L131 PetriNetUnfolder]: For 33536/33536 co-relation queries the response was YES. [2022-12-13 11:11:33,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15763 conditions, 2030 events. 992/2030 cut-off events. For 33536/33536 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 13787 event pairs, 537 based on Foata normal form. 4/2016 useless extension candidates. Maximal degree in co-relation 14491. Up to 2018 conditions per place. [2022-12-13 11:11:33,264 INFO L137 encePairwiseOnDemand]: 51/53 looper letters, 184 selfloop transitions, 0 changer transitions 7/191 dead transitions. [2022-12-13 11:11:33,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 191 transitions, 3946 flow [2022-12-13 11:11:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:11:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:11:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 11:11:33,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3710691823899371 [2022-12-13 11:11:33,265 INFO L175 Difference]: Start difference. First operand has 135 places, 186 transitions, 3540 flow. Second operand 3 states and 59 transitions. [2022-12-13 11:11:33,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 191 transitions, 3946 flow [2022-12-13 11:11:33,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 191 transitions, 3750 flow, removed 98 selfloop flow, removed 1 redundant places. [2022-12-13 11:11:33,385 INFO L231 Difference]: Finished difference. Result has 137 places, 184 transitions, 3289 flow [2022-12-13 11:11:33,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3289, PETRI_PLACES=137, PETRI_TRANSITIONS=184} [2022-12-13 11:11:33,389 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 116 predicate places. [2022-12-13 11:11:33,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:33,389 INFO L89 Accepts]: Start accepts. Operand has 137 places, 184 transitions, 3289 flow [2022-12-13 11:11:33,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:33,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:33,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 184 transitions, 3289 flow [2022-12-13 11:11:33,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 184 transitions, 3289 flow [2022-12-13 11:11:33,475 INFO L130 PetriNetUnfolder]: 193/823 cut-off events. [2022-12-13 11:11:33,475 INFO L131 PetriNetUnfolder]: For 10468/10535 co-relation queries the response was YES. [2022-12-13 11:11:33,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5369 conditions, 823 events. 193/823 cut-off events. For 10468/10535 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7145 event pairs, 21 based on Foata normal form. 3/807 useless extension candidates. Maximal degree in co-relation 5244. Up to 257 conditions per place. [2022-12-13 11:11:33,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 184 transitions, 3289 flow [2022-12-13 11:11:33,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 11:11:33,486 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:33,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 11:11:33,487 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 184 transitions, 3289 flow [2022-12-13 11:11:33,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:33,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:33,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:33,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 11:11:33,488 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 11:11:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash -884896778, now seen corresponding path program 1 times [2022-12-13 11:11:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:33,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074565030] [2022-12-13 11:11:33,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:33,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074565030] [2022-12-13 11:11:33,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074565030] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:33,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736086780] [2022-12-13 11:11:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:33,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:33,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:33,584 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 11:11:33,610 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 11:11:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 11:11:33,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:33,730 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 11:11:33,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:33,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736086780] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:33,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:33,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 11:11:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41655459] [2022-12-13 11:11:33,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:33,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:11:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:33,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:11:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:11:33,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 11:11:33,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 184 transitions, 3289 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 11:11:33,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:33,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 11:11:33,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:34,484 INFO L130 PetriNetUnfolder]: 1029/2092 cut-off events. [2022-12-13 11:11:34,484 INFO L131 PetriNetUnfolder]: For 33761/33761 co-relation queries the response was YES. [2022-12-13 11:11:34,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15952 conditions, 2092 events. 1029/2092 cut-off events. For 33761/33761 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14204 event pairs, 497 based on Foata normal form. 18/2094 useless extension candidates. Maximal degree in co-relation 15532. Up to 1866 conditions per place. [2022-12-13 11:11:34,502 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 193 selfloop transitions, 41 changer transitions 8/242 dead transitions. [2022-12-13 11:11:34,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 242 transitions, 4456 flow [2022-12-13 11:11:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:11:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 11:11:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2022-12-13 11:11:34,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17159763313609466 [2022-12-13 11:11:34,506 INFO L175 Difference]: Start difference. First operand has 134 places, 184 transitions, 3289 flow. Second operand 13 states and 116 transitions. [2022-12-13 11:11:34,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 242 transitions, 4456 flow [2022-12-13 11:11:34,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 242 transitions, 4392 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-12-13 11:11:34,621 INFO L231 Difference]: Finished difference. Result has 150 places, 199 transitions, 3692 flow [2022-12-13 11:11:34,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3241, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3692, PETRI_PLACES=150, PETRI_TRANSITIONS=199} [2022-12-13 11:11:34,622 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 129 predicate places. [2022-12-13 11:11:34,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:34,622 INFO L89 Accepts]: Start accepts. Operand has 150 places, 199 transitions, 3692 flow [2022-12-13 11:11:34,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:34,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:34,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 199 transitions, 3692 flow [2022-12-13 11:11:34,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 199 transitions, 3692 flow [2022-12-13 11:11:34,740 INFO L130 PetriNetUnfolder]: 201/857 cut-off events. [2022-12-13 11:11:34,741 INFO L131 PetriNetUnfolder]: For 11657/11716 co-relation queries the response was YES. [2022-12-13 11:11:34,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 857 events. 201/857 cut-off events. For 11657/11716 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7530 event pairs, 21 based on Foata normal form. 3/843 useless extension candidates. Maximal degree in co-relation 5655. Up to 272 conditions per place. [2022-12-13 11:11:34,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 199 transitions, 3692 flow [2022-12-13 11:11:34,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-13 11:11:34,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 11:11:35,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_159| v_~f~0.base_94))) (let ((.cse2 (select .cse1 (+ (* v_~x1~0_122 4) v_~f~0.offset_94)))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_94 (* .cse2 4)))) (.cse3 (* (mod v_~n~0_106 2147483648) 2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= v_~x1~0_120 (select .cse1 (+ v_~f~0.offset_94 (* .cse0 4)))) (not (= (ite (and (< .cse2 v_~size~0_106) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_122) (< v_~x1~0_122 v_~size~0_106)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 2) 4294967296) .cse3) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967296) .cse3) (= |v_thread1Thread1of1ForFork0_~i~0#1_112| (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 3)))))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_122, ~f~0.offset=v_~f~0.offset_94} 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_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_120, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_94} AuxVars[] 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 11:11:36,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [680] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_295| v_~f~0.base_208))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_208 (* v_~x1~0_334 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_208 (* .cse3 4))))) (let ((.cse0 (* (mod v_~n~0_216 2147483648) 2)) (.cse1 (select .cse4 (+ v_~f~0.offset_208 (* 4 .cse2))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_292| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x1~0_334) (< v_~x1~0_334 v_~size~0_216)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_170| (ite (and (< .cse1 v_~size~0_216) (<= 0 .cse1)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_170| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_186|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_292| 2) 4294967296) .cse0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_290| 4294967295) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_290| (+ |v_thread1Thread1of1ForFork0_~i~0#1_292| 4)) (not (= (ite (and (< .cse2 v_~size~0_216) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_216)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_186| 0)) (= (select .cse4 (+ v_~f~0.offset_208 (* .cse1 4))) v_~x1~0_332)))))) InVars {~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_292|, #memory_int=|v_#memory_int_295|, ~n~0=v_~n~0_216, ~x1~0=v_~x1~0_334, ~f~0.offset=v_~f~0.offset_208} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_188|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_170|, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_290|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_186|, #memory_int=|v_#memory_int_295|, ~n~0=v_~n~0_216, ~x1~0=v_~x1~0_332, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_196|, ~f~0.offset=v_~f~0.offset_208} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 11:11:38,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [686] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_305| v_~f~0.base_218))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_218 (* v_~x1~0_358 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_218 (* .cse5 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_218 (* 4 .cse1))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_218 (* .cse0 4)))) (.cse2 (* (mod v_~n~0_226 2147483648) 2))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_226)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_316| 4294967296) .cse2) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_316| 5) |v_thread1Thread1of1ForFork0_~i~0#1_314|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_316| 2) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_226)) 1 0)) (= (select .cse4 (+ v_~f~0.offset_218 (* .cse3 4))) v_~x1~0_356) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_314| 4294967295) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|) (not (= (ite (and (< v_~x1~0_358 v_~size~0_226) (<= 0 v_~x1~0_358)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_226) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200| 0)))))))) InVars {~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_218, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_316|, #memory_int=|v_#memory_int_305|, ~n~0=v_~n~0_226, ~x1~0=v_~x1~0_358, ~f~0.offset=v_~f~0.offset_218} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184|, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_218, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_314|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|, #memory_int=|v_#memory_int_305|, ~n~0=v_~n~0_226, ~x1~0=v_~x1~0_356, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_210|, ~f~0.offset=v_~f~0.offset_218} AuxVars[] 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 11:11:43,129 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:11:43,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8508 [2022-12-13 11:11:43,130 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 199 transitions, 4011 flow [2022-12-13 11:11:43,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 11:11:43,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:43,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:43,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:11:43,335 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,SelfDestructingSolverStorable28 [2022-12-13 11:11:43,335 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 11:11:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash -619840238, now seen corresponding path program 1 times [2022-12-13 11:11:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175779773] [2022-12-13 11:11:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,403 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 11:11:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:43,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175779773] [2022-12-13 11:11:43,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175779773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:43,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:43,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:11:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371726251] [2022-12-13 11:11:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:43,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:11:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:43,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:11:43,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:11:43,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 11:11:43,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 199 transitions, 4011 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 11:11:43,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:43,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 11:11:43,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:44,029 INFO L130 PetriNetUnfolder]: 1023/2086 cut-off events. [2022-12-13 11:11:44,030 INFO L131 PetriNetUnfolder]: For 37821/37821 co-relation queries the response was YES. [2022-12-13 11:11:44,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16909 conditions, 2086 events. 1023/2086 cut-off events. For 37821/37821 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14234 event pairs, 534 based on Foata normal form. 6/2076 useless extension candidates. Maximal degree in co-relation 16324. Up to 2066 conditions per place. [2022-12-13 11:11:44,053 INFO L137 encePairwiseOnDemand]: 58/63 looper letters, 195 selfloop transitions, 3 changer transitions 10/208 dead transitions. [2022-12-13 11:11:44,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 208 transitions, 4519 flow [2022-12-13 11:11:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:11:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:11:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 11:11:44,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30158730158730157 [2022-12-13 11:11:44,055 INFO L175 Difference]: Start difference. First operand has 150 places, 199 transitions, 4011 flow. Second operand 4 states and 76 transitions. [2022-12-13 11:11:44,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 208 transitions, 4519 flow [2022-12-13 11:11:44,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 208 transitions, 4155 flow, removed 170 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:44,187 INFO L231 Difference]: Finished difference. Result has 152 places, 197 transitions, 3592 flow [2022-12-13 11:11:44,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=3647, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3592, PETRI_PLACES=152, PETRI_TRANSITIONS=197} [2022-12-13 11:11:44,188 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-13 11:11:44,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:44,188 INFO L89 Accepts]: Start accepts. Operand has 152 places, 197 transitions, 3592 flow [2022-12-13 11:11:44,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:44,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:44,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 197 transitions, 3592 flow [2022-12-13 11:11:44,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 197 transitions, 3592 flow [2022-12-13 11:11:44,318 INFO L130 PetriNetUnfolder]: 227/896 cut-off events. [2022-12-13 11:11:44,318 INFO L131 PetriNetUnfolder]: For 13980/14019 co-relation queries the response was YES. [2022-12-13 11:11:44,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6283 conditions, 896 events. 227/896 cut-off events. For 13980/14019 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7772 event pairs, 47 based on Foata normal form. 3/878 useless extension candidates. Maximal degree in co-relation 6203. Up to 285 conditions per place. [2022-12-13 11:11:44,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 197 transitions, 3592 flow [2022-12-13 11:11:44,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-13 11:11:44,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_275| v_~f~0.base_188))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_188 (* v_~x1~0_312 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_188 (* v_~x2~0_260 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_188 (* .cse1 4)))) (.cse2 (select .cse5 (+ v_~f~0.offset_188 (* .cse0 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_188 (* .cse2 4)))) (.cse6 (select .cse5 (+ v_~f~0.offset_188 (* .cse4 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_196)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_172|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_172| 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_196)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_156|) (= |v_thread2Thread1of1ForFork1_~i~1#1_198| 4) (= |v_thread1Thread1of1ForFork0_~i~0#1_261| 4) (not (= (ite (and (< .cse4 v_~size~0_196) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_312 v_~size~0_196) (<= 0 v_~x1~0_312)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_165| 0)) (= v_~x1~0_310 (select .cse5 (+ v_~f~0.offset_188 (* .cse3 4)))) (not (= (ite (and (<= 0 v_~x2~0_260) (< v_~x2~0_260 v_~size~0_196)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_165|) (= v_~x2~0_258 (select .cse5 (+ v_~f~0.offset_188 (* .cse6 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| (ite (and (< .cse6 v_~size~0_196) (<= 0 .cse6)) 1 0)) (< 2 (* (mod v_~n~0_196 2147483648) 2))))))) InVars {~x2~0=v_~x2~0_260, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_188, #memory_int=|v_#memory_int_275|, ~n~0=v_~n~0_196, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_188} OutVars{~x2~0=v_~x2~0_258, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_174|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_127|, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_188, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_131|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_198|, ~x1~0=v_~x1~0_310, ~f~0.offset=v_~f~0.offset_188, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_165|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_156|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, #memory_int=|v_#memory_int_275|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_172|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_117|, ~n~0=v_~n~0_196, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_117|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_182|} 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 11:11:45,392 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:11:45,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1205 [2022-12-13 11:11:45,393 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 196 transitions, 3597 flow [2022-12-13 11:11:45,393 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 11:11:45,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:45,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:45,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 11:11:45,393 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 11:11:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash -523625037, now seen corresponding path program 1 times [2022-12-13 11:11:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799018289] [2022-12-13 11:11:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:45,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799018289] [2022-12-13 11:11:45,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799018289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:45,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:45,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175998028] [2022-12-13 11:11:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:45,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:11:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:45,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:11:45,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:11:45,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 11:11:45,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 196 transitions, 3597 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:45,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:45,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 11:11:45,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:45,953 INFO L130 PetriNetUnfolder]: 1010/2058 cut-off events. [2022-12-13 11:11:45,954 INFO L131 PetriNetUnfolder]: For 40182/40182 co-relation queries the response was YES. [2022-12-13 11:11:45,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16620 conditions, 2058 events. 1010/2058 cut-off events. For 40182/40182 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14008 event pairs, 370 based on Foata normal form. 2/2048 useless extension candidates. Maximal degree in co-relation 16515. Up to 1544 conditions per place. [2022-12-13 11:11:45,970 INFO L137 encePairwiseOnDemand]: 41/62 looper letters, 166 selfloop transitions, 36 changer transitions 1/203 dead transitions. [2022-12-13 11:11:45,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 203 transitions, 4080 flow [2022-12-13 11:11:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:11:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:11:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 11:11:45,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2022-12-13 11:11:45,972 INFO L175 Difference]: Start difference. First operand has 149 places, 196 transitions, 3597 flow. Second operand 3 states and 74 transitions. [2022-12-13 11:11:45,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 203 transitions, 4080 flow [2022-12-13 11:11:46,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 203 transitions, 4041 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-13 11:11:46,055 INFO L231 Difference]: Finished difference. Result has 148 places, 194 transitions, 3568 flow [2022-12-13 11:11:46,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3568, PETRI_PLACES=148, PETRI_TRANSITIONS=194} [2022-12-13 11:11:46,056 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-13 11:11:46,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:46,056 INFO L89 Accepts]: Start accepts. Operand has 148 places, 194 transitions, 3568 flow [2022-12-13 11:11:46,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:46,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:46,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 194 transitions, 3568 flow [2022-12-13 11:11:46,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 194 transitions, 3568 flow [2022-12-13 11:11:46,159 INFO L130 PetriNetUnfolder]: 225/903 cut-off events. [2022-12-13 11:11:46,159 INFO L131 PetriNetUnfolder]: For 14258/14297 co-relation queries the response was YES. [2022-12-13 11:11:46,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6286 conditions, 903 events. 225/903 cut-off events. For 14258/14297 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7885 event pairs, 47 based on Foata normal form. 3/885 useless extension candidates. Maximal degree in co-relation 6064. Up to 283 conditions per place. [2022-12-13 11:11:46,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 194 transitions, 3568 flow [2022-12-13 11:11:46,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 11:11:46,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_256| v_~f~0.base_170))) (let ((.cse0 (* 2 (mod v_~n~0_178 2147483648))) (.cse3 (select .cse1 (+ v_~f~0.offset_170 (* v_~x1~0_273 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_170 (* v_~x2~0_225 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_223| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_168| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_167| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_168|)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_223| 1) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_273 v_~size~0_178) (<= 0 v_~x1~0_273)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_225) (< v_~x2~0_225 v_~size~0_178)) 1 0) 0)) (= v_~x2~0_224 (select .cse1 (+ v_~f~0.offset_170 (* .cse2 4)))) (= v_~x1~0_272 (select .cse1 (+ v_~f~0.offset_170 (* .cse3 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_178)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_178)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_222| (+ |v_thread1Thread1of1ForFork0_~i~0#1_223| 2))))) InVars {~x2~0=v_~x2~0_225, ~size~0=v_~size~0_178, ~f~0.base=v_~f~0.base_170, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_223|, #memory_int=|v_#memory_int_256|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_168|, ~n~0=v_~n~0_178, ~x1~0=v_~x1~0_273, ~f~0.offset=v_~f~0.offset_170} OutVars{~x2~0=v_~x2~0_224, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_152|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_108|, ~size~0=v_~size~0_178, ~f~0.base=v_~f~0.base_170, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_112|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_167|, ~x1~0=v_~x1~0_272, ~f~0.offset=v_~f~0.offset_170, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_222|, #memory_int=|v_#memory_int_256|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_98|, ~n~0=v_~n~0_178, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_98|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_160|} 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 [684] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_303| v_~f~0.base_216))) (let ((.cse2 (select .cse4 (+ (* v_~x1~0_353 4) v_~f~0.offset_216)))) (let ((.cse0 (* (mod v_~n~0_224 2147483648) 2)) (.cse1 (select .cse4 (+ (* .cse2 4) v_~f~0.offset_216))) (.cse3 (select .cse4 (+ v_~f~0.offset_216 (* v_~x2~0_319 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_311| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_182| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_224)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_224)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_255|) |v_thread2Thread1of1ForFork1_~i~1#1_254|) (not (= (ite (and (<= 0 v_~x2~0_319) (< v_~x2~0_319 v_~size~0_224)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_353 v_~size~0_224) (<= 0 v_~x1~0_353)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_255| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_175| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_199|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_199| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_182| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_198|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_198| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_175| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_224)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_310| (+ |v_thread1Thread1of1ForFork0_~i~0#1_311| 3)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_311| 2) 4294967296) .cse0) (= (select .cse4 (+ v_~f~0.offset_216 (* .cse1 4))) v_~x1~0_352) (= (select .cse4 (+ v_~f~0.offset_216 (* .cse3 4))) v_~x2~0_318))))) InVars {~x2~0=v_~x2~0_319, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_216, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_311|, #memory_int=|v_#memory_int_303|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_255|, ~n~0=v_~n~0_224, ~x1~0=v_~x1~0_353, ~f~0.offset=v_~f~0.offset_216} OutVars{~x2~0=v_~x2~0_318, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_200|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_161|, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_216, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_165|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_175|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_254|, ~x1~0=v_~x1~0_352, ~f~0.offset=v_~f~0.offset_216, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_199|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_182|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_310|, #memory_int=|v_#memory_int_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_198|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_151|, ~n~0=v_~n~0_224, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_151|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_208|} 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 11:11:48,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_256| v_~f~0.base_170))) (let ((.cse0 (* 2 (mod v_~n~0_178 2147483648))) (.cse3 (select .cse1 (+ v_~f~0.offset_170 (* v_~x1~0_273 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_170 (* v_~x2~0_225 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_223| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_168| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_167| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_168|)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_223| 1) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_273 v_~size~0_178) (<= 0 v_~x1~0_273)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_225) (< v_~x2~0_225 v_~size~0_178)) 1 0) 0)) (= v_~x2~0_224 (select .cse1 (+ v_~f~0.offset_170 (* .cse2 4)))) (= v_~x1~0_272 (select .cse1 (+ v_~f~0.offset_170 (* .cse3 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_178)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_178)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_222| (+ |v_thread1Thread1of1ForFork0_~i~0#1_223| 2))))) InVars {~x2~0=v_~x2~0_225, ~size~0=v_~size~0_178, ~f~0.base=v_~f~0.base_170, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_223|, #memory_int=|v_#memory_int_256|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_168|, ~n~0=v_~n~0_178, ~x1~0=v_~x1~0_273, ~f~0.offset=v_~f~0.offset_170} OutVars{~x2~0=v_~x2~0_224, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_152|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_108|, ~size~0=v_~size~0_178, ~f~0.base=v_~f~0.base_170, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_112|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_167|, ~x1~0=v_~x1~0_272, ~f~0.offset=v_~f~0.offset_170, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_222|, #memory_int=|v_#memory_int_256|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_98|, ~n~0=v_~n~0_178, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_98|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_160|} 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 [690] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_311| v_~f~0.base_224))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_224 (* v_~x2~0_332 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_224 (* .cse4 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_224 (* v_~x1~0_371 4))))) (let ((.cse1 (select .cse0 (+ (* .cse6 4) v_~f~0.offset_224))) (.cse2 (* 2 (mod v_~n~0_232 2147483648))) (.cse5 (select .cse0 (+ v_~f~0.offset_224 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_55| 0) (not (= (ite (and (<= 0 v_~x1~0_371) (< v_~x1~0_371 v_~size~0_232)) 1 0) 0)) (= v_~x1~0_370 (select .cse0 (+ v_~f~0.offset_224 (* .cse1 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_328| 4294967296) .cse2)) (not (= (ite (and (< v_~x2~0_332 v_~size~0_232) (<= 0 v_~x2~0_332)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_232) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_329| 2) 4294967296) .cse2) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_329| 3) |v_thread1Thread1of1ForFork0_~i~0#1_328|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_232)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_232)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181|) (not (= (ite (and (< .cse6 v_~size~0_232) (<= 0 .cse6)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_268| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_268| 4) |v_thread2Thread1of1ForFork1_~i~1#1_266|) (= |v_thread1Thread1of1ForFork0_#res#1.base_55| 0) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_232)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192|) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_268|) 4294967296) .cse2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205| 0)) (= v_~x2~0_330 (select .cse0 (+ v_~f~0.offset_224 (* 4 .cse5))))))))) InVars {~x2~0=v_~x2~0_332, ~size~0=v_~size~0_232, ~f~0.base=v_~f~0.base_224, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_329|, #memory_int=|v_#memory_int_311|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_268|, ~n~0=v_~n~0_232, ~x1~0=v_~x1~0_371, ~f~0.offset=v_~f~0.offset_224} OutVars{~x2~0=v_~x2~0_330, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_210|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_167|, ~size~0=v_~size~0_232, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_55|, ~f~0.base=v_~f~0.base_224, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_171|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_266|, ~x1~0=v_~x1~0_370, ~f~0.offset=v_~f~0.offset_224, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_328|, #memory_int=|v_#memory_int_311|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_157|, ~n~0=v_~n~0_232, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_157|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_218|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_55|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 11:11:49,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:11:49,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3665 [2022-12-13 11:11:49,721 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 194 transitions, 3623 flow [2022-12-13 11:11:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:49,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:49,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 11:11:49,722 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 11:11:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1331124621, now seen corresponding path program 1 times [2022-12-13 11:11:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:49,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047295095] [2022-12-13 11:11:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,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 11:11:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:49,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047295095] [2022-12-13 11:11:49,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047295095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:49,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:49,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:11:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84340685] [2022-12-13 11:11:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:11:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:11:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:11:49,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 11:11:49,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 194 transitions, 3623 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 11:11:49,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:49,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 11:11:49,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:50,290 INFO L130 PetriNetUnfolder]: 1017/2071 cut-off events. [2022-12-13 11:11:50,291 INFO L131 PetriNetUnfolder]: For 39502/39502 co-relation queries the response was YES. [2022-12-13 11:11:50,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16880 conditions, 2071 events. 1017/2071 cut-off events. For 39502/39502 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14124 event pairs, 520 based on Foata normal form. 8/2065 useless extension candidates. Maximal degree in co-relation 16349. Up to 2052 conditions per place. [2022-12-13 11:11:50,305 INFO L137 encePairwiseOnDemand]: 56/61 looper letters, 196 selfloop transitions, 6 changer transitions 0/202 dead transitions. [2022-12-13 11:11:50,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 202 transitions, 4195 flow [2022-12-13 11:11:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:11:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:11:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 11:11:50,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29098360655737704 [2022-12-13 11:11:50,306 INFO L175 Difference]: Start difference. First operand has 147 places, 194 transitions, 3623 flow. Second operand 4 states and 71 transitions. [2022-12-13 11:11:50,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 202 transitions, 4195 flow [2022-12-13 11:11:50,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 202 transitions, 4067 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:50,388 INFO L231 Difference]: Finished difference. Result has 150 places, 197 transitions, 3610 flow [2022-12-13 11:11:50,388 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3495, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3610, PETRI_PLACES=150, PETRI_TRANSITIONS=197} [2022-12-13 11:11:50,389 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 129 predicate places. [2022-12-13 11:11:50,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:50,389 INFO L89 Accepts]: Start accepts. Operand has 150 places, 197 transitions, 3610 flow [2022-12-13 11:11:50,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:50,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:50,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 197 transitions, 3610 flow [2022-12-13 11:11:50,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 197 transitions, 3610 flow [2022-12-13 11:11:50,486 INFO L130 PetriNetUnfolder]: 232/914 cut-off events. [2022-12-13 11:11:50,486 INFO L131 PetriNetUnfolder]: For 16249/16288 co-relation queries the response was YES. [2022-12-13 11:11:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 914 events. 232/914 cut-off events. For 16249/16288 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7921 event pairs, 47 based on Foata normal form. 3/895 useless extension candidates. Maximal degree in co-relation 6374. Up to 292 conditions per place. [2022-12-13 11:11:50,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 197 transitions, 3610 flow [2022-12-13 11:11:50,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-13 11:11:51,211 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:11:51,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 823 [2022-12-13 11:11:51,212 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 197 transitions, 3619 flow [2022-12-13 11:11:51,212 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 11:11:51,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:51,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:51,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 11:11:51,213 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 11:11:51,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1244246573, now seen corresponding path program 1 times [2022-12-13 11:11:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:51,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742480038] [2022-12-13 11:11:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:51,283 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 11:11:51,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:51,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742480038] [2022-12-13 11:11:51,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742480038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:51,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:51,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368979419] [2022-12-13 11:11:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:51,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:11:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:51,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:11:51,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:11:51,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 11:11:51,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 197 transitions, 3619 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:51,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:51,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 11:11:51,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:51,844 INFO L130 PetriNetUnfolder]: 1029/2091 cut-off events. [2022-12-13 11:11:51,844 INFO L131 PetriNetUnfolder]: For 44021/44021 co-relation queries the response was YES. [2022-12-13 11:11:51,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17377 conditions, 2091 events. 1029/2091 cut-off events. For 44021/44021 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14209 event pairs, 520 based on Foata normal form. 8/2085 useless extension candidates. Maximal degree in co-relation 16832. Up to 2064 conditions per place. [2022-12-13 11:11:51,869 INFO L137 encePairwiseOnDemand]: 57/62 looper letters, 196 selfloop transitions, 7 changer transitions 0/203 dead transitions. [2022-12-13 11:11:51,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 203 transitions, 4143 flow [2022-12-13 11:11:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:11:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:11:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 11:11:51,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2022-12-13 11:11:51,872 INFO L175 Difference]: Start difference. First operand has 150 places, 197 transitions, 3619 flow. Second operand 3 states and 67 transitions. [2022-12-13 11:11:51,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 203 transitions, 4143 flow [2022-12-13 11:11:52,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 203 transitions, 4085 flow, removed 29 selfloop flow, removed 0 redundant places. [2022-12-13 11:11:52,016 INFO L231 Difference]: Finished difference. Result has 153 places, 199 transitions, 3630 flow [2022-12-13 11:11:52,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3561, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3630, PETRI_PLACES=153, PETRI_TRANSITIONS=199} [2022-12-13 11:11:52,016 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2022-12-13 11:11:52,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:52,017 INFO L89 Accepts]: Start accepts. Operand has 153 places, 199 transitions, 3630 flow [2022-12-13 11:11:52,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:52,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:52,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 199 transitions, 3630 flow [2022-12-13 11:11:52,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 199 transitions, 3630 flow [2022-12-13 11:11:52,152 INFO L130 PetriNetUnfolder]: 236/922 cut-off events. [2022-12-13 11:11:52,152 INFO L131 PetriNetUnfolder]: For 17655/17695 co-relation queries the response was YES. [2022-12-13 11:11:52,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6779 conditions, 922 events. 236/922 cut-off events. For 17655/17695 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7981 event pairs, 48 based on Foata normal form. 3/903 useless extension candidates. Maximal degree in co-relation 6543. Up to 299 conditions per place. [2022-12-13 11:11:52,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 199 transitions, 3630 flow [2022-12-13 11:11:52,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-13 11:11:52,170 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:52,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 11:11:52,171 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 199 transitions, 3630 flow [2022-12-13 11:11:52,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:52,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:52,172 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:52,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 11:11:52,172 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 11:11:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -36929470, now seen corresponding path program 1 times [2022-12-13 11:11:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:52,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848992415] [2022-12-13 11:11:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:52,261 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 11:11:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:52,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848992415] [2022-12-13 11:11:52,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848992415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:52,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:52,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822942257] [2022-12-13 11:11:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:52,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:11:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:11:52,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:11:52,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 11:11:52,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 199 transitions, 3630 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:52,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:52,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 11:11:52,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:52,689 INFO L130 PetriNetUnfolder]: 1027/2089 cut-off events. [2022-12-13 11:11:52,689 INFO L131 PetriNetUnfolder]: For 45625/45625 co-relation queries the response was YES. [2022-12-13 11:11:52,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17491 conditions, 2089 events. 1027/2089 cut-off events. For 45625/45625 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14210 event pairs, 527 based on Foata normal form. 2/2077 useless extension candidates. Maximal degree in co-relation 16936. Up to 2015 conditions per place. [2022-12-13 11:11:52,707 INFO L137 encePairwiseOnDemand]: 49/62 looper letters, 183 selfloop transitions, 16 changer transitions 7/206 dead transitions. [2022-12-13 11:11:52,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 206 transitions, 4065 flow [2022-12-13 11:11:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:11:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:11:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 11:11:52,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2022-12-13 11:11:52,708 INFO L175 Difference]: Start difference. First operand has 153 places, 199 transitions, 3630 flow. Second operand 3 states and 70 transitions. [2022-12-13 11:11:52,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 206 transitions, 4065 flow [2022-12-13 11:11:52,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 206 transitions, 4038 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 11:11:52,810 INFO L231 Difference]: Finished difference. Result has 154 places, 198 transitions, 3602 flow [2022-12-13 11:11:52,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3570, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3602, PETRI_PLACES=154, PETRI_TRANSITIONS=198} [2022-12-13 11:11:52,819 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 133 predicate places. [2022-12-13 11:11:52,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:52,819 INFO L89 Accepts]: Start accepts. Operand has 154 places, 198 transitions, 3602 flow [2022-12-13 11:11:52,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:52,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:52,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 198 transitions, 3602 flow [2022-12-13 11:11:52,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 198 transitions, 3602 flow [2022-12-13 11:11:52,950 INFO L130 PetriNetUnfolder]: 235/923 cut-off events. [2022-12-13 11:11:52,951 INFO L131 PetriNetUnfolder]: For 17543/17583 co-relation queries the response was YES. [2022-12-13 11:11:52,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6748 conditions, 923 events. 235/923 cut-off events. For 17543/17583 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8016 event pairs, 49 based on Foata normal form. 3/904 useless extension candidates. Maximal degree in co-relation 6512. Up to 299 conditions per place. [2022-12-13 11:11:52,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 198 transitions, 3602 flow [2022-12-13 11:11:52,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 11:11:52,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:52,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 11:11:52,969 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 198 transitions, 3602 flow [2022-12-13 11:11:52,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:52,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:52,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:52,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 11:11:52,969 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 11:11:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 361947399, now seen corresponding path program 1 times [2022-12-13 11:11:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:52,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48519653] [2022-12-13 11:11:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,078 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 11:11:53,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:53,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48519653] [2022-12-13 11:11:53,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48519653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:53,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500233014] [2022-12-13 11:11:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:53,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:53,080 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 11:11:53,083 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 11:11:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:11:53,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:53,265 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 11:11:53,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:53,285 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 11:11:53,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500233014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:53,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:53,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 11:11:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599848430] [2022-12-13 11:11:53,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:53,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:11:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:11:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:53,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 11:11:53,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 198 transitions, 3602 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 11:11:53,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:53,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 11:11:53,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:53,820 INFO L130 PetriNetUnfolder]: 1051/2129 cut-off events. [2022-12-13 11:11:53,821 INFO L131 PetriNetUnfolder]: For 48387/48387 co-relation queries the response was YES. [2022-12-13 11:11:53,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17941 conditions, 2129 events. 1051/2129 cut-off events. For 48387/48387 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14534 event pairs, 466 based on Foata normal form. 18/2133 useless extension candidates. Maximal degree in co-relation 17386. Up to 1969 conditions per place. [2022-12-13 11:11:53,840 INFO L137 encePairwiseOnDemand]: 48/61 looper letters, 189 selfloop transitions, 28 changer transitions 1/218 dead transitions. [2022-12-13 11:11:53,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 218 transitions, 4450 flow [2022-12-13 11:11:53,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:11:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-13 11:11:53,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22950819672131148 [2022-12-13 11:11:53,841 INFO L175 Difference]: Start difference. First operand has 154 places, 198 transitions, 3602 flow. Second operand 6 states and 84 transitions. [2022-12-13 11:11:53,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 218 transitions, 4450 flow [2022-12-13 11:11:53,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 218 transitions, 4418 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:11:53,943 INFO L231 Difference]: Finished difference. Result has 160 places, 202 transitions, 3776 flow [2022-12-13 11:11:53,944 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3570, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3776, PETRI_PLACES=160, PETRI_TRANSITIONS=202} [2022-12-13 11:11:53,944 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 139 predicate places. [2022-12-13 11:11:53,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:53,944 INFO L89 Accepts]: Start accepts. Operand has 160 places, 202 transitions, 3776 flow [2022-12-13 11:11:53,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:53,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:53,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 202 transitions, 3776 flow [2022-12-13 11:11:53,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 202 transitions, 3776 flow [2022-12-13 11:11:54,062 INFO L130 PetriNetUnfolder]: 244/938 cut-off events. [2022-12-13 11:11:54,063 INFO L131 PetriNetUnfolder]: For 21629/21672 co-relation queries the response was YES. [2022-12-13 11:11:54,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7302 conditions, 938 events. 244/938 cut-off events. For 21629/21672 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8106 event pairs, 51 based on Foata normal form. 3/917 useless extension candidates. Maximal degree in co-relation 7051. Up to 317 conditions per place. [2022-12-13 11:11:54,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 202 transitions, 3776 flow [2022-12-13 11:11:54,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 11:11:54,073 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:54,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 11:11:54,074 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 202 transitions, 3776 flow [2022-12-13 11:11:54,074 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 11:11:54,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:54,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:54,080 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 11:11:54,277 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,SelfDestructingSolverStorable34 [2022-12-13 11:11:54,278 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 11:11:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2031783652, now seen corresponding path program 1 times [2022-12-13 11:11:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:54,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655539658] [2022-12-13 11:11:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:57,597 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 11:11:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:57,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655539658] [2022-12-13 11:11:57,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655539658] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:57,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846068178] [2022-12-13 11:11:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:57,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:57,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:57,599 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 11:11:57,601 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 11:11:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:57,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 11:11:57,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:57,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:11:57,769 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 11:11:57,772 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 11:11:57,809 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 11:11:58,103 INFO L321 Elim1Store]: treesize reduction 145, result has 14.2 percent of original size [2022-12-13 11:11:58,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 1011 treesize of output 306 [2022-12-13 11:11:58,413 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 11:11:58,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:19,564 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 11:12:19,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846068178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:19,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:19,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-13 11:12:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630824666] [2022-12-13 11:12:19,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:19,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:12:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:12:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=123, Unknown=4, NotChecked=0, Total=182 [2022-12-13 11:12:19,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 11:12:19,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 202 transitions, 3776 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 11:12:19,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:19,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 11:12:19,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:40,720 WARN L233 SmtUtils]: Spent 20.99s on a formula simplification that was a NOOP. DAG size: 204 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:12:58,765 WARN L233 SmtUtils]: Spent 14.52s on a formula simplification that was a NOOP. DAG size: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:13:03,305 INFO L130 PetriNetUnfolder]: 1136/2277 cut-off events. [2022-12-13 11:13:03,305 INFO L131 PetriNetUnfolder]: For 61854/61854 co-relation queries the response was YES. [2022-12-13 11:13:03,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20243 conditions, 2277 events. 1136/2277 cut-off events. For 61854/61854 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 15674 event pairs, 271 based on Foata normal form. 3/2266 useless extension candidates. Maximal degree in co-relation 19661. Up to 1948 conditions per place. [2022-12-13 11:13:03,324 INFO L137 encePairwiseOnDemand]: 20/61 looper letters, 171 selfloop transitions, 85 changer transitions 25/281 dead transitions. [2022-12-13 11:13:03,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 281 transitions, 5388 flow [2022-12-13 11:13:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:13:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 11:13:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 145 transitions. [2022-12-13 11:13:03,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15846994535519127 [2022-12-13 11:13:03,326 INFO L175 Difference]: Start difference. First operand has 160 places, 202 transitions, 3776 flow. Second operand 15 states and 145 transitions. [2022-12-13 11:13:03,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 281 transitions, 5388 flow [2022-12-13 11:13:03,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 281 transitions, 5321 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 11:13:03,439 INFO L231 Difference]: Finished difference. Result has 180 places, 225 transitions, 4590 flow [2022-12-13 11:13:03,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3726, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4590, PETRI_PLACES=180, PETRI_TRANSITIONS=225} [2022-12-13 11:13:03,439 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 159 predicate places. [2022-12-13 11:13:03,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:03,439 INFO L89 Accepts]: Start accepts. Operand has 180 places, 225 transitions, 4590 flow [2022-12-13 11:13:03,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:03,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:03,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 225 transitions, 4590 flow [2022-12-13 11:13:03,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 225 transitions, 4590 flow [2022-12-13 11:13:03,559 INFO L130 PetriNetUnfolder]: 269/985 cut-off events. [2022-12-13 11:13:03,560 INFO L131 PetriNetUnfolder]: For 27260/27326 co-relation queries the response was YES. [2022-12-13 11:13:03,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 985 events. 269/985 cut-off events. For 27260/27326 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8475 event pairs, 54 based on Foata normal form. 5/967 useless extension candidates. Maximal degree in co-relation 8101. Up to 356 conditions per place. [2022-12-13 11:13:03,574 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 225 transitions, 4590 flow [2022-12-13 11:13:03,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 608 [2022-12-13 11:13:05,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L49-2-->L49-2: Formula: (let ((.cse6 (select |v_#memory_int_317| v_~f~0.base_230))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_230 (* v_~x1~0_380 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_230 (* .cse1 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_230 (* .cse5 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_230 (* .cse3 4))))) (let ((.cse0 (* (mod v_~n~0_238 2147483648) 2)) (.cse2 (select .cse6 (+ v_~f~0.offset_230 (* .cse4 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 2) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_336| (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 6)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_238)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_238)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 5) 4294967296) .cse0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 4) 4294967296) .cse0) (not (= (ite (and (< .cse3 v_~size~0_238) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_338| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|) (not (= (ite (and (< .cse4 v_~size~0_238) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_238) (<= 0 .cse5)) 1 0) 0)) (= (select .cse6 (+ v_~f~0.offset_230 (* .cse2 4))) v_~x1~0_378) (not (= 0 (ite (and (<= 0 v_~x1~0_380) (< v_~x1~0_380 v_~size~0_238)) 1 0)))))))))) InVars {~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, #memory_int=|v_#memory_int_317|, ~n~0=v_~n~0_238, ~x1~0=v_~x1~0_380, ~f~0.offset=v_~f~0.offset_230} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|, ~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_336|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|, #memory_int=|v_#memory_int_317|, ~n~0=v_~n~0_238, ~x1~0=v_~x1~0_378, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_222|, ~f~0.offset=v_~f~0.offset_230} AuxVars[] 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 [704] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_327| v_~f~0.base_240))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_240 (* v_~x2~0_370 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_240 (* .cse4 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_240 (* .cse3 4)))) (.cse0 (* 2 (mod v_~n~0_248 2147483648)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_229|) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_306|) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_229| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_248)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_370) (< v_~x2~0_370 v_~size~0_248)) 1 0) 0)) (= v_~x2~0_368 (select .cse2 (+ v_~f~0.offset_240 (* .cse1 4)))) (not (= 0 (ite (and (< .cse3 v_~size~0_248) (<= 0 .cse3)) 1 0))) (= |v_thread2Thread1of1ForFork1_~i~1#1_304| (+ |v_thread2Thread1of1ForFork1_~i~1#1_306| 4)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_306| 4294967296) .cse0) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_248)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_370, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_240, #memory_int=|v_#memory_int_327|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_306|, ~n~0=v_~n~0_248, ~f~0.offset=v_~f~0.offset_240} OutVars{~x2~0=v_~x2~0_368, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_191|, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_240, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_195|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_304|, ~f~0.offset=v_~f~0.offset_240, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_229|, #memory_int=|v_#memory_int_327|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_181|, ~n~0=v_~n~0_248, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_181|} 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 11:13:09,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [711] L49-2-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_In_38| v_~f~0.base_In_32))) (let ((.cse22 (select .cse10 (+ (* v_~x2~0_In_29 4) v_~f~0.offset_In_32))) (.cse24 (select .cse10 (+ (* v_~x1~0_In_17 4) v_~f~0.offset_In_32)))) (let ((.cse23 (select .cse10 (+ v_~f~0.offset_In_32 (* .cse24 4)))) (.cse26 (select .cse10 (+ (* .cse22 4) v_~f~0.offset_In_32)))) (let ((.cse21 (select .cse10 (+ (* .cse26 4) v_~f~0.offset_In_32))) (.cse16 (* (mod v_~n~0_In_36 2147483648) 2)) (.cse25 (select .cse10 (+ v_~f~0.offset_In_32 (* .cse23 4))))) (let ((.cse0 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_30| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_30|)) (.cse1 (not (= (ite (and (<= 0 v_~x1~0_In_17) (< v_~x1~0_In_17 v_~size~0_In_31)) 1 0) 0))) (.cse20 (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_In_31)) 1 0)) (.cse2 (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_54| (+ 4 |v_thread2Thread1of1ForFork1_~i~1#1_In_26|))) (.cse3 (not (= (ite (and (<= 0 v_~x2~0_In_29) (< v_~x2~0_In_29 v_~size~0_In_31)) 1 0) 0))) (.cse4 (not (= (ite (and (< .cse26 v_~size~0_In_31) (<= 0 .cse26)) 1 0) 0))) (.cse5 (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_18| 4294967296) .cse16)) (.cse9 (select .cse10 (+ (* .cse25 4) v_~f~0.offset_In_32))) (.cse6 (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_In_31)) 1 0) 0))) (.cse7 (not (= (ite (and (< .cse23 v_~size~0_In_31) (<= 0 .cse23)) 1 0) 0))) (.cse8 (= v_~x2~0_Out_58 (select .cse10 (+ v_~f~0.offset_In_32 (* 4 .cse21))))) (.cse11 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_30| 0))) (.cse12 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_54| 0))) (.cse13 (not (= (ite (and (< .cse22 v_~size~0_In_31) (<= 0 .cse22)) 1 0) 0))) (.cse14 (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_26| 4294967296) .cse16)) (.cse15 (< (mod (+ 2 |v_thread1Thread1of1ForFork0_~i~0#1_In_18|) 4294967296) .cse16)) (.cse17 (= (ite (and (< .cse21 v_~size~0_In_31) (<= 0 .cse21)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_54|)) (.cse18 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_54| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_54|)) (.cse19 (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_Out_30| 4294967295) 4294967296) .cse16))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_30| (ite (and (< .cse9 v_~size~0_In_31) (<= 0 .cse9)) 1 0)) (= v_~x1~0_Out_34 (select .cse10 (+ (* .cse9 4) v_~f~0.offset_In_32))) .cse11 .cse12 .cse13 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_30| (+ 5 |v_thread1Thread1of1ForFork0_~i~0#1_In_18|)) .cse14 .cse15 (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_In_26|) 4294967296) .cse16) .cse17 .cse18 .cse19 (not (= .cse20 0))) (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_30| .cse20) .cse2 .cse3 .cse4 .cse5 (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_Out_54| 4294967294) 4294967296) .cse16) (= .cse9 v_~x1~0_Out_34) .cse6 .cse7 .cse8 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_30| (+ 4 |v_thread1Thread1of1ForFork0_~i~0#1_In_18|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19))))))) InVars {~x2~0=v_~x2~0_In_29, ~size~0=v_~size~0_In_31, ~f~0.base=v_~f~0.base_In_32, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_18|, #memory_int=|v_#memory_int_In_38|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_26|, ~n~0=v_~n~0_In_36, ~x1~0=v_~x1~0_In_17, ~f~0.offset=v_~f~0.offset_In_32} OutVars{~x2~0=v_~x2~0_Out_58, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_30|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_54|, ~size~0=v_~size~0_In_31, ~f~0.base=v_~f~0.base_In_32, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_54|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_54|, ~x1~0=v_~x1~0_Out_34, ~f~0.offset=v_~f~0.offset_In_32, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_54|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_30|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_30|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_30|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_50|, ~n~0=v_~n~0_In_36, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_50|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_30|} 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 11:13:10,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [715] L49-2-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_337| v_~f~0.base_250))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_250 (* v_~x2~0_398 4))))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_250 (* .cse0 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_250 (* 4 .cse1)))) (.cse2 (* (mod v_~n~0_258 2147483648) 2)) (.cse3 (select .cse5 (+ v_~f~0.offset_250 (* v_~x1~0_417 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_417) (< v_~x1~0_417 v_~size~0_258)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_258)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_373| 2) |v_thread1Thread1of1ForFork0_~i~0#1_372|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_234|) (not (= (ite (and (< .cse1 v_~size~0_258) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_330| 4294967296) .cse2) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_258)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_258)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_373| 1) 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_398) (< v_~x2~0_398 v_~size~0_258)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_373| 4294967296) .cse2) (= (select .cse5 (+ v_~f~0.offset_250 (* .cse4 4))) v_~x2~0_396) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_330|) 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_234| 0)) (= v_~x1~0_416 (select .cse5 (+ v_~f~0.offset_250 (* .cse3 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|) (= |v_thread2Thread1of1ForFork1_~i~1#1_328| (+ |v_thread2Thread1of1ForFork1_~i~1#1_330| 4))))))) InVars {~x2~0=v_~x2~0_398, ~size~0=v_~size~0_258, ~f~0.base=v_~f~0.base_250, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_373|, #memory_int=|v_#memory_int_337|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_330|, ~n~0=v_~n~0_258, ~x1~0=v_~x1~0_417, ~f~0.offset=v_~f~0.offset_250} OutVars{~x2~0=v_~x2~0_396, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_236|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_209|, ~size~0=v_~size~0_258, ~f~0.base=v_~f~0.base_250, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_213|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_328|, ~x1~0=v_~x1~0_416, ~f~0.offset=v_~f~0.offset_250, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_372|, #memory_int=|v_#memory_int_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_234|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_199|, ~n~0=v_~n~0_258, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_199|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_244|} 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 11:13:11,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [720] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_346| v_~f~0.base_256))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_256 (* v_~x1~0_437 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_256 (* 4 .cse8))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_256 (* .cse7 4)))) (.cse9 (select .cse3 (+ v_~f~0.offset_256 (* v_~x2~0_420 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_256 (* .cse9 4)))) (.cse5 (select .cse3 (+ v_~f~0.offset_256 (* .cse6 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_256 (* .cse5 4)))) (.cse0 (* (mod v_~n~0_264 2147483648) 2)) (.cse4 (select .cse3 (+ v_~f~0.offset_256 (* .cse1 4))))) (and (not (= (ite (and (< v_~x1~0_437 v_~size~0_264) (<= 0 v_~x1~0_437)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263| 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_350| 4) |v_thread2Thread1of1ForFork1_~i~1#1_349|) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_391| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_68| 0) (not (= (ite (and (< .cse1 v_~size~0_264) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_420) (< v_~x2~0_420 v_~size~0_264)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_264)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_392| 6) |v_thread1Thread1of1ForFork0_~i~0#1_391|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_349|) 4294967296) .cse0) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_392| 4294967296) .cse0) (= (select .cse3 (+ v_~f~0.offset_256 (* .cse4 4))) v_~x2~0_419) (= |v_thread1Thread1of1ForFork0_#res#1.base_68| 0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_350| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247| 0)) (= (select .cse3 (+ v_~f~0.offset_256 (* .cse2 4))) v_~x1~0_436) (not (= (ite (and (< .cse5 v_~size~0_264) (<= 0 .cse5)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_392| 5) 4294967296) .cse0) (not (= (ite (and (< .cse6 v_~size~0_264) (<= 0 .cse6)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| (ite (and (< .cse4 v_~size~0_264) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_264) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_264) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_264)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_420, ~size~0=v_~size~0_264, ~f~0.base=v_~f~0.base_256, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_392|, #memory_int=|v_#memory_int_346|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_350|, ~n~0=v_~n~0_264, ~x1~0=v_~x1~0_437, ~f~0.offset=v_~f~0.offset_256} OutVars{~x2~0=v_~x2~0_419, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_249|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_225|, ~size~0=v_~size~0_264, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_68|, ~f~0.base=v_~f~0.base_256, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_229|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_349|, ~x1~0=v_~x1~0_436, ~f~0.offset=v_~f~0.offset_256, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_391|, #memory_int=|v_#memory_int_346|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_215|, ~n~0=v_~n~0_264, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_215|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_257|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_68|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 11:13:12,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [713] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_335| v_~f~0.base_248))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_248 (* v_~x1~0_412 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_248 (* v_~x2~0_392 4)))) (.cse8 (select .cse4 (+ v_~f~0.offset_248 (* .cse7 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_248 (* .cse8 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_248 (* .cse6 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_248 (* .cse2 4)))) (.cse5 (select .cse4 (+ v_~f~0.offset_248 (* .cse3 4)))) (.cse0 (* (mod v_~n~0_256 2147483648) 2))) (and (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_324| 4) |v_thread2Thread1of1ForFork1_~i~1#1_322|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_324| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_368| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_256)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_256)) 1 0) 0)) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_324|) 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230| 0)) (not (= (ite (and (< .cse3 v_~size~0_256) (<= 0 .cse3)) 1 0) 0)) (= v_~x2~0_390 (select .cse4 (+ (* 4 .cse1) v_~f~0.offset_248))) (= v_~x1~0_410 (select .cse4 (+ v_~f~0.offset_248 (* .cse5 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_366| (+ |v_thread1Thread1of1ForFork0_~i~0#1_368| 5)) (not (= (ite (and (< .cse6 v_~size~0_256) (<= 0 .cse6)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|) (not (= (ite (and (< v_~x2~0_392 v_~size~0_256) (<= 0 v_~x2~0_392)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_368| 4) 4294967296) .cse0) (not (= (ite (and (< .cse7 v_~size~0_256) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_412) (< v_~x1~0_412 v_~size~0_256)) 1 0) 0)) (= (ite (and (< .cse5 v_~size~0_256) (<= 0 .cse5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_368| 2) 4294967296) .cse0) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_256)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_392, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_248, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_368|, #memory_int=|v_#memory_int_335|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_324|, ~n~0=v_~n~0_256, ~x1~0=v_~x1~0_412, ~f~0.offset=v_~f~0.offset_248} OutVars{~x2~0=v_~x2~0_390, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_232|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_205|, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_248, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_209|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_322|, ~x1~0=v_~x1~0_410, ~f~0.offset=v_~f~0.offset_248, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_366|, #memory_int=|v_#memory_int_335|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_195|, ~n~0=v_~n~0_256, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_195|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_240|} 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 11:13:13,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [721] L49-2-->L59-2: Formula: (let ((.cse9 (select |v_#memory_int_348| v_~f~0.base_258))) (let ((.cse6 (select .cse9 (+ v_~f~0.offset_258 (* v_~x1~0_441 4))))) (let ((.cse7 (select .cse9 (+ v_~f~0.offset_258 (* .cse6 4))))) (let ((.cse3 (select .cse9 (+ v_~f~0.offset_258 (* .cse7 4)))) (.cse8 (select .cse9 (+ (* v_~x2~0_424 4) v_~f~0.offset_258)))) (let ((.cse2 (select .cse9 (+ v_~f~0.offset_258 (* .cse8 4)))) (.cse1 (select .cse9 (+ v_~f~0.offset_258 (* .cse3 4))))) (let ((.cse0 (* 2 (mod v_~n~0_266 2147483648))) (.cse5 (select .cse9 (+ v_~f~0.offset_258 (* .cse1 4)))) (.cse4 (select .cse9 (+ v_~f~0.offset_258 (* .cse2 4))))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_354| 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_266) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_396| 5) 4294967296) .cse0) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_266)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_354| 4) |v_thread2Thread1of1ForFork1_~i~1#1_353|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_266)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_265| 0)) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_354|) 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x1~0_441) (< v_~x1~0_441 v_~size~0_266)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_265|) (not (= (ite (and (< v_~x2~0_424 v_~size~0_266) (<= 0 v_~x2~0_424)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_396| 2) 4294967296) .cse0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_396| 4) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| (ite (and (< .cse4 v_~size~0_266) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_395| (+ |v_thread1Thread1of1ForFork0_~i~0#1_396| 6)) (= (ite (and (< .cse5 v_~size~0_266) (<= 0 .cse5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_396| 4294967296) .cse0) (not (= (ite (and (< .cse6 v_~size~0_266) (<= 0 .cse6)) 1 0) 0)) (not (= 0 (ite (and (< .cse7 v_~size~0_266) (<= 0 .cse7)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_266)) 1 0) 0)) (= (select .cse9 (+ v_~f~0.offset_258 (* 4 .cse5))) v_~x1~0_440) (= v_~x2~0_423 (select .cse9 (+ v_~f~0.offset_258 (* .cse4 4))))))))))) InVars {~x2~0=v_~x2~0_424, ~size~0=v_~size~0_266, ~f~0.base=v_~f~0.base_258, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_396|, #memory_int=|v_#memory_int_348|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_354|, ~n~0=v_~n~0_266, ~x1~0=v_~x1~0_441, ~f~0.offset=v_~f~0.offset_258} OutVars{~x2~0=v_~x2~0_423, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_251|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_227|, ~size~0=v_~size~0_266, ~f~0.base=v_~f~0.base_258, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_231|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_353|, ~x1~0=v_~x1~0_440, ~f~0.offset=v_~f~0.offset_258, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_265|, 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_395|, #memory_int=|v_#memory_int_348|, 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_217|, ~n~0=v_~n~0_266, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_217|, 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] [2022-12-13 11:13:14,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [695] L49-2-->L49-2: Formula: (let ((.cse6 (select |v_#memory_int_317| v_~f~0.base_230))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_230 (* v_~x1~0_380 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_230 (* .cse1 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_230 (* .cse5 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_230 (* .cse3 4))))) (let ((.cse0 (* (mod v_~n~0_238 2147483648) 2)) (.cse2 (select .cse6 (+ v_~f~0.offset_230 (* .cse4 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 2) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_336| (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 6)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_238)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_238)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 5) 4294967296) .cse0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 4) 4294967296) .cse0) (not (= (ite (and (< .cse3 v_~size~0_238) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_338| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|) (not (= (ite (and (< .cse4 v_~size~0_238) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_238) (<= 0 .cse5)) 1 0) 0)) (= (select .cse6 (+ v_~f~0.offset_230 (* .cse2 4))) v_~x1~0_378) (not (= 0 (ite (and (<= 0 v_~x1~0_380) (< v_~x1~0_380 v_~size~0_238)) 1 0)))))))))) InVars {~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, #memory_int=|v_#memory_int_317|, ~n~0=v_~n~0_238, ~x1~0=v_~x1~0_380, ~f~0.offset=v_~f~0.offset_230} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|, ~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_336|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|, #memory_int=|v_#memory_int_317|, ~n~0=v_~n~0_238, ~x1~0=v_~x1~0_378, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_222|, ~f~0.offset=v_~f~0.offset_230} AuxVars[] 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 11:13:15,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [657] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_256| v_~f~0.base_170))) (let ((.cse0 (* 2 (mod v_~n~0_178 2147483648))) (.cse3 (select .cse1 (+ v_~f~0.offset_170 (* v_~x1~0_273 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_170 (* v_~x2~0_225 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_223| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_168| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_167| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_168|)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_223| 1) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_273 v_~size~0_178) (<= 0 v_~x1~0_273)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_225) (< v_~x2~0_225 v_~size~0_178)) 1 0) 0)) (= v_~x2~0_224 (select .cse1 (+ v_~f~0.offset_170 (* .cse2 4)))) (= v_~x1~0_272 (select .cse1 (+ v_~f~0.offset_170 (* .cse3 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_178)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_178)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_222| (+ |v_thread1Thread1of1ForFork0_~i~0#1_223| 2))))) InVars {~x2~0=v_~x2~0_225, ~size~0=v_~size~0_178, ~f~0.base=v_~f~0.base_170, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_223|, #memory_int=|v_#memory_int_256|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_168|, ~n~0=v_~n~0_178, ~x1~0=v_~x1~0_273, ~f~0.offset=v_~f~0.offset_170} OutVars{~x2~0=v_~x2~0_224, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_152|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_108|, ~size~0=v_~size~0_178, ~f~0.base=v_~f~0.base_170, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_112|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_167|, ~x1~0=v_~x1~0_272, ~f~0.offset=v_~f~0.offset_170, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_222|, #memory_int=|v_#memory_int_256|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_98|, ~n~0=v_~n~0_178, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_98|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_160|} 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 11:13:15,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [725] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_352| v_~f~0.base_262))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_262 (* v_~x2~0_429 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_262 (* .cse5 4)))) (.cse10 (select .cse0 (+ v_~f~0.offset_262 (* v_~x1~0_451 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_262 (* .cse10 4)))) (.cse8 (select .cse0 (+ v_~f~0.offset_262 (* .cse2 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_262 (* .cse8 4)))) (.cse9 (select .cse0 (+ v_~f~0.offset_262 (* .cse6 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_262 (* .cse9 4)))) (.cse4 (* (mod v_~n~0_270 2147483648) 2)) (.cse3 (select .cse0 (+ v_~f~0.offset_262 (* .cse7 4))))) (and (= v_~x1~0_450 (select .cse0 (+ v_~f~0.offset_262 (* 4 .cse1)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255| 0)) (not (= (ite (and (<= 0 v_~x1~0_451) (< v_~x1~0_451 v_~size~0_270)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_270)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| (ite (and (< .cse3 v_~size~0_270) (<= 0 .cse3)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_406| 2) 4294967296) .cse4) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_359| 4) 4294967296) .cse4) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_406| 4) 4294967296) .cse4) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_359| 4294967296) .cse4) (= (ite (and (< .cse1 v_~size~0_270) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_239|) (not (= (ite (and (< .cse5 v_~size~0_270) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_270)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_429) (< v_~x2~0_429 v_~size~0_270)) 1 0))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_406| 4294967296) .cse4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_239| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255|) (= |v_thread2Thread1of1ForFork1_~i~1#1_357| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_359|)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_270)) 1 0) 0)) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_359|) 4294967296) .cse4) (= (select .cse0 (+ v_~f~0.offset_262 (* .cse3 4))) v_~x2~0_427) (= |v_thread1Thread1of1ForFork0_~i~0#1_405| (+ |v_thread1Thread1of1ForFork0_~i~0#1_406| 5)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267| 0)) (not (= (ite (and (< .cse8 v_~size~0_270) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|) (not (= (ite (and (< .cse9 v_~size~0_270) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_270)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_429, ~size~0=v_~size~0_270, ~f~0.base=v_~f~0.base_262, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_406|, #memory_int=|v_#memory_int_352|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_359|, ~n~0=v_~n~0_270, ~x1~0=v_~x1~0_451, ~f~0.offset=v_~f~0.offset_262} OutVars{~x2~0=v_~x2~0_427, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_257|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_229|, ~size~0=v_~size~0_270, ~f~0.base=v_~f~0.base_262, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_233|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_357|, ~x1~0=v_~x1~0_450, ~f~0.offset=v_~f~0.offset_262, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_239|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_405|, #memory_int=|v_#memory_int_352|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_219|, ~n~0=v_~n~0_270, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_219|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_265|} 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 11:13:16,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [678] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_293| v_~f~0.base_206))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_206 (* v_~x1~0_329 4))))) (let ((.cse1 (* 2 (mod v_~n~0_214 2147483648))) (.cse3 (select .cse4 (+ (* v_~x2~0_301 4) v_~f~0.offset_206))) (.cse0 (select .cse4 (+ v_~f~0.offset_206 (* .cse2 4))))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_214)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_287| 2) 4294967296) .cse1) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_287| 4294967296) .cse1) (not (= (ite (and (< .cse2 v_~size~0_214) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_329 v_~size~0_214) (<= 0 v_~x1~0_329)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_189| 0)) (not (= (ite (and (< v_~x2~0_301 v_~size~0_214) (<= 0 v_~x2~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_189|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165| (ite (and (< .cse3 v_~size~0_214) (<= 0 .cse3)) 1 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_236|) |v_thread2Thread1of1ForFork1_~i~1#1_235|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_236| 4294967296) .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_287| 3) |v_thread1Thread1of1ForFork0_~i~0#1_286|) (= v_~x2~0_300 (select .cse4 (+ v_~f~0.offset_206 (* .cse3 4)))) (= v_~x1~0_328 (select .cse4 (+ v_~f~0.offset_206 (* .cse0 4)))))))) InVars {~x2~0=v_~x2~0_301, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_206, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_287|, #memory_int=|v_#memory_int_293|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_236|, ~n~0=v_~n~0_214, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_206} OutVars{~x2~0=v_~x2~0_300, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_151|, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_206, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_155|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_235|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_206, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_189|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_286|, #memory_int=|v_#memory_int_293|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_141|, ~n~0=v_~n~0_214, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_141|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 11:13:17,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [687] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_307| v_~f~0.base_220))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_220 (* v_~x1~0_363 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_220 (* 4 .cse0))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_220 (* .cse5 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_220 (* v_~x2~0_323 4)))) (.cse3 (* (mod v_~n~0_228 2147483648) 2))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_228)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_220 (* .cse2 4))) v_~x1~0_362) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_320| 4294967295) 4294967296) .cse3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_177| (ite (and (< .cse4 v_~size~0_228) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_53| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_204| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_204|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_323) (< v_~x2~0_323 v_~size~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_53| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_177| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201| 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_259|) |v_thread2Thread1of1ForFork1_~i~1#1_258|) (= |v_thread1Thread1of1ForFork0_~i~0#1_320| (+ |v_thread1Thread1of1ForFork0_~i~0#1_321| 4)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_228)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_320| 4294967296) .cse3)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_321| 4294967296) .cse3) (= (select .cse1 (+ v_~f~0.offset_220 (* .cse4 4))) v_~x2~0_322) (not (= (ite (and (< v_~x1~0_363 v_~size~0_228) (<= 0 v_~x1~0_363)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_259| 4294967296) .cse3)))))) InVars {~x2~0=v_~x2~0_323, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_220, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_321|, #memory_int=|v_#memory_int_307|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_259|, ~n~0=v_~n~0_228, ~x1~0=v_~x1~0_363, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_322, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_206|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_163|, ~size~0=v_~size~0_228, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_53|, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_167|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_177|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_258|, ~x1~0=v_~x1~0_362, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_320|, #memory_int=|v_#memory_int_307|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_204|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_153|, ~n~0=v_~n~0_228, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_153|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_214|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_53|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 11:13:18,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_235| v_~f~0.base_150))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_150 (* v_~x2~0_178 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_150 (* v_~x1~0_243 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_243) (< v_~x1~0_243 v_~size~0_158)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_194| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_158)) 1 0)) (= (ite (and (< .cse1 v_~size~0_158) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= (select .cse2 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x2~0_177) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= (ite (and (<= 0 v_~x2~0_178) (< v_~x2~0_178 v_~size~0_158)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= v_~x1~0_242 (select .cse2 (+ v_~f~0.offset_150 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0)) (< 0 (* (mod v_~n~0_158 2147483648) 2))))) InVars {~x2~0=v_~x2~0_178, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_158, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_150} OutVars{~x2~0=v_~x2~0_177, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_80|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_150, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, ~x1~0=v_~x1~0_242, ~f~0.offset=v_~f~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_70|, ~n~0=v_~n~0_158, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_70|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} 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 [660] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_262| v_~f~0.base_176))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_176 (* v_~x2~0_237 4)))) (.cse0 (* (mod v_~n~0_184 2147483648) 2))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_235| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_237 v_~size~0_184) (<= 0 v_~x2~0_237)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_184)) 1 0)) (= v_~x2~0_236 (select .cse2 (+ v_~f~0.offset_176 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_234| (+ |v_thread1Thread1of1ForFork0_~i~0#1_235| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152| 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_180|) |v_thread2Thread1of1ForFork1_~i~1#1_179|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_180| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156| 0)) (= v_~x1~0_284 (select .cse2 (+ v_~f~0.offset_176 (* v_~x1~0_285 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|) (= (ite (and (< v_~x1~0_285 v_~size~0_184) (<= 0 v_~x1~0_285)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|)))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_235|, #memory_int=|v_#memory_int_262|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_180|, ~n~0=v_~n~0_184, ~x1~0=v_~x1~0_285, ~f~0.offset=v_~f~0.offset_176} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_158|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_114|, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_118|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_179|, ~x1~0=v_~x1~0_284, ~f~0.offset=v_~f~0.offset_176, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_234|, #memory_int=|v_#memory_int_262|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_104|, ~n~0=v_~n~0_184, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_104|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_166|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, 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 11:13:19,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_120| v_~f~0.base_70))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_70 (* v_~x2~0_98 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_79|) (not (= (ite (and (< v_~x2~0_98 v_~size~0_84) (<= 0 v_~x2~0_98)) 1 0) 0)) (< 0 (* 2 (mod v_~n~0_80 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_84)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse1 (+ v_~f~0.offset_70 (* .cse0 4))) v_~x2~0_97)))) InVars {~x2~0=v_~x2~0_98, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, #memory_int=|v_#memory_int_120|, ~n~0=v_~n~0_80, ~f~0.offset=v_~f~0.offset_70} OutVars{~x2~0=v_~x2~0_97, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_35|, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_79|, ~f~0.offset=v_~f~0.offset_70, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|, #memory_int=|v_#memory_int_120|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_25|, ~n~0=v_~n~0_80, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:13:19,512 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:13:19,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16074 [2022-12-13 11:13:19,513 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 225 transitions, 4811 flow [2022-12-13 11:13:19,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 11:13:19,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:19,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:19,523 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 11:13:19,720 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,SelfDestructingSolverStorable35 [2022-12-13 11:13:19,720 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 11:13:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1967338937, now seen corresponding path program 1 times [2022-12-13 11:13:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:19,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555144143] [2022-12-13 11:13:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:19,855 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 11:13:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555144143] [2022-12-13 11:13:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555144143] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887298740] [2022-12-13 11:13:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:13:19,858 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 11:13:19,884 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 11:13:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:19,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 11:13:19,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:20,005 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 11:13:20,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:20,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 11:13:20,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887298740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:20,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:20,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 11:13:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592092614] [2022-12-13 11:13:20,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:20,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:13:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:13:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:13:20,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 11:13:20,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 225 transitions, 4811 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:20,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:20,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 11:13:20,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:21,861 INFO L130 PetriNetUnfolder]: 1313/2625 cut-off events. [2022-12-13 11:13:21,861 INFO L131 PetriNetUnfolder]: For 92469/92469 co-relation queries the response was YES. [2022-12-13 11:13:21,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25560 conditions, 2625 events. 1313/2625 cut-off events. For 92469/92469 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 18428 event pairs, 165 based on Foata normal form. 123/2736 useless extension candidates. Maximal degree in co-relation 25185. Up to 1156 conditions per place. [2022-12-13 11:13:21,882 INFO L137 encePairwiseOnDemand]: 17/68 looper letters, 162 selfloop transitions, 162 changer transitions 7/331 dead transitions. [2022-12-13 11:13:21,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 331 transitions, 7224 flow [2022-12-13 11:13:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:13:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 11:13:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 176 transitions. [2022-12-13 11:13:21,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16176470588235295 [2022-12-13 11:13:21,883 INFO L175 Difference]: Start difference. First operand has 180 places, 225 transitions, 4811 flow. Second operand 16 states and 176 transitions. [2022-12-13 11:13:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 331 transitions, 7224 flow [2022-12-13 11:13:22,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 331 transitions, 6561 flow, removed 295 selfloop flow, removed 8 redundant places. [2022-12-13 11:13:22,057 INFO L231 Difference]: Finished difference. Result has 196 places, 252 transitions, 5436 flow [2022-12-13 11:13:22,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=4099, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5436, PETRI_PLACES=196, PETRI_TRANSITIONS=252} [2022-12-13 11:13:22,058 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 175 predicate places. [2022-12-13 11:13:22,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:22,058 INFO L89 Accepts]: Start accepts. Operand has 196 places, 252 transitions, 5436 flow [2022-12-13 11:13:22,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:22,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:22,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 252 transitions, 5436 flow [2022-12-13 11:13:22,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 252 transitions, 5436 flow [2022-12-13 11:13:22,232 INFO L130 PetriNetUnfolder]: 306/1101 cut-off events. [2022-12-13 11:13:22,232 INFO L131 PetriNetUnfolder]: For 43907/43955 co-relation queries the response was YES. [2022-12-13 11:13:22,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11125 conditions, 1101 events. 306/1101 cut-off events. For 43907/43955 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9607 event pairs, 67 based on Foata normal form. 2/1086 useless extension candidates. Maximal degree in co-relation 10947. Up to 437 conditions per place. [2022-12-13 11:13:22,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 252 transitions, 5436 flow [2022-12-13 11:13:22,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-13 11:13:23,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_120| v_~f~0.base_70))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_70 (* v_~x2~0_98 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_79|) (not (= (ite (and (< v_~x2~0_98 v_~size~0_84) (<= 0 v_~x2~0_98)) 1 0) 0)) (< 0 (* 2 (mod v_~n~0_80 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_84)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse1 (+ v_~f~0.offset_70 (* .cse0 4))) v_~x2~0_97)))) InVars {~x2~0=v_~x2~0_98, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, #memory_int=|v_#memory_int_120|, ~n~0=v_~n~0_80, ~f~0.offset=v_~f~0.offset_70} OutVars{~x2~0=v_~x2~0_97, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_35|, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_79|, ~f~0.offset=v_~f~0.offset_70, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|, #memory_int=|v_#memory_int_120|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_25|, ~n~0=v_~n~0_80, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:13:23,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [756] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_385| v_~f~0.base_294))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_294 (* v_~x1~0_539 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_294 (* .cse7 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_294 (* .cse3 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_294 (* .cse9 4))))) (let ((.cse2 (select .cse0 (+ (* .cse4 4) v_~f~0.offset_294)))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_294 (* .cse2 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_294 (* .cse5 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_294 (* v_~x2~0_515 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_294 (* .cse8 4))))) (and (not (= (ite (and (< v_~x2~0_515 v_~size~0_302) (<= 0 v_~x2~0_515)) 1 0) 0)) (= v_~x2~0_514 (select .cse0 (+ v_~f~0.offset_294 (* .cse1 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_302)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_302) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_312| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_467| 9) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_301| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_302)) 1 0)) (not (= (ite (and (< .cse4 v_~size~0_302) (<= 0 .cse4)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_467| 4294967295) 4294967296) (* 2 (mod v_~n~0_302 2147483648))) (not (= (ite (and (< .cse5 v_~size~0_302) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_539 v_~size~0_302) (<= 0 v_~x1~0_539)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_417|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_296| (ite (and (< .cse6 v_~size~0_302) (<= 0 .cse6)) 1 0)) (= (select .cse0 (+ v_~f~0.offset_294 (* .cse6 4))) v_~x1~0_537) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_301| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_325|) (not (= (ite (and (< .cse7 v_~size~0_302) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_296| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_312|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_325| 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_302)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_302) (<= 0 .cse9)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_515, ~size~0=v_~size~0_302, ~f~0.base=v_~f~0.base_294, #memory_int=|v_#memory_int_385|, ~n~0=v_~n~0_302, ~x1~0=v_~x1~0_539, ~f~0.offset=v_~f~0.offset_294} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_314|, ~x2~0=v_~x2~0_514, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_287|, ~size~0=v_~size~0_302, ~f~0.base=v_~f~0.base_294, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_291|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_301|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_417|, ~x1~0=v_~x1~0_537, ~f~0.offset=v_~f~0.offset_294, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_325|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_296|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_467|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_312|, #memory_int=|v_#memory_int_385|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_277|, ~n~0=v_~n~0_302, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_322|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_277|} 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 [704] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_327| v_~f~0.base_240))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_240 (* v_~x2~0_370 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_240 (* .cse4 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_240 (* .cse3 4)))) (.cse0 (* 2 (mod v_~n~0_248 2147483648)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_229|) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_306|) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_229| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_248)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_370) (< v_~x2~0_370 v_~size~0_248)) 1 0) 0)) (= v_~x2~0_368 (select .cse2 (+ v_~f~0.offset_240 (* .cse1 4)))) (not (= 0 (ite (and (< .cse3 v_~size~0_248) (<= 0 .cse3)) 1 0))) (= |v_thread2Thread1of1ForFork1_~i~1#1_304| (+ |v_thread2Thread1of1ForFork1_~i~1#1_306| 4)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_306| 4294967296) .cse0) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_248)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_370, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_240, #memory_int=|v_#memory_int_327|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_306|, ~n~0=v_~n~0_248, ~f~0.offset=v_~f~0.offset_240} OutVars{~x2~0=v_~x2~0_368, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_191|, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_240, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_195|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_304|, ~f~0.offset=v_~f~0.offset_240, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_229|, #memory_int=|v_#memory_int_327|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_181|, ~n~0=v_~n~0_248, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_181|} 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 11:13:24,820 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:13:24,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2763 [2022-12-13 11:13:24,821 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 251 transitions, 5485 flow [2022-12-13 11:13:24,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:24,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:24,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:24,830 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 11:13:25,027 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,SelfDestructingSolverStorable36 [2022-12-13 11:13:25,027 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 11:13:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash 45447895, now seen corresponding path program 1 times [2022-12-13 11:13:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:25,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487120362] [2022-12-13 11:13:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:26,624 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 11:13:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487120362] [2022-12-13 11:13:26,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487120362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348705278] [2022-12-13 11:13:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:26,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:13:26,627 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 11:13:26,630 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 11:13:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:26,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 11:13:26,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:26,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:26,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 152 [2022-12-13 11:13:27,230 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 11:13:27,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:28,886 INFO L321 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2022-12-13 11:13:28,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 99 treesize of output 666 [2022-12-13 11:13:40,474 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 11:13:40,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348705278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:40,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:40,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 11:13:40,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187505392] [2022-12-13 11:13:40,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:40,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:13:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:13:40,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:13:40,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 11:13:40,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 251 transitions, 5485 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:40,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:40,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 11:13:40,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:42,097 INFO L130 PetriNetUnfolder]: 1359/2688 cut-off events. [2022-12-13 11:13:42,097 INFO L131 PetriNetUnfolder]: For 125873/125873 co-relation queries the response was YES. [2022-12-13 11:13:42,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29628 conditions, 2688 events. 1359/2688 cut-off events. For 125873/125873 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18790 event pairs, 555 based on Foata normal form. 4/2670 useless extension candidates. Maximal degree in co-relation 29241. Up to 2132 conditions per place. [2022-12-13 11:13:42,123 INFO L137 encePairwiseOnDemand]: 26/70 looper letters, 201 selfloop transitions, 82 changer transitions 17/300 dead transitions. [2022-12-13 11:13:42,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 300 transitions, 6761 flow [2022-12-13 11:13:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:13:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:13:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-13 11:13:42,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21607142857142858 [2022-12-13 11:13:42,126 INFO L175 Difference]: Start difference. First operand has 193 places, 251 transitions, 5485 flow. Second operand 8 states and 121 transitions. [2022-12-13 11:13:42,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 300 transitions, 6761 flow [2022-12-13 11:13:42,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 300 transitions, 6300 flow, removed 203 selfloop flow, removed 8 redundant places. [2022-12-13 11:13:42,380 INFO L231 Difference]: Finished difference. Result has 195 places, 256 transitions, 5416 flow [2022-12-13 11:13:42,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=5058, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5416, PETRI_PLACES=195, PETRI_TRANSITIONS=256} [2022-12-13 11:13:42,381 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 174 predicate places. [2022-12-13 11:13:42,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:42,381 INFO L89 Accepts]: Start accepts. Operand has 195 places, 256 transitions, 5416 flow [2022-12-13 11:13:42,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:42,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:42,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 256 transitions, 5416 flow [2022-12-13 11:13:42,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 256 transitions, 5416 flow [2022-12-13 11:13:42,546 INFO L130 PetriNetUnfolder]: 317/1140 cut-off events. [2022-12-13 11:13:42,546 INFO L131 PetriNetUnfolder]: For 40398/40470 co-relation queries the response was YES. [2022-12-13 11:13:42,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10939 conditions, 1140 events. 317/1140 cut-off events. For 40398/40470 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9978 event pairs, 71 based on Foata normal form. 3/1124 useless extension candidates. Maximal degree in co-relation 10704. Up to 433 conditions per place. [2022-12-13 11:13:42,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 256 transitions, 5416 flow [2022-12-13 11:13:42,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-13 11:13:43,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_370| v_~f~0.base_280))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_280 (* v_~x1~0_504 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_280 (* .cse0 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_280 (* v_~x2~0_481 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_280 (* .cse3 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_280 (* .cse7 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_280 (* .cse5 4)))) (.cse6 (select .cse1 (+ (* .cse4 4) v_~f~0.offset_280)))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_393| 4) (not (= (ite (and (< .cse0 v_~size~0_288) (<= 0 .cse0)) 1 0) 0)) (= v_~x1~0_502 (select .cse1 (+ v_~f~0.offset_280 (* 4 .cse2)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_301| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_441| 4294967295) 4294967296) (* 2 (mod v_~n~0_288 2147483648))) (not (= (ite (and (< v_~x1~0_504 v_~size~0_288) (<= 0 v_~x1~0_504)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_481) (< v_~x2~0_481 v_~size~0_288)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_288)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_288) (<= 0 .cse4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273| (ite (and (< .cse2 v_~size~0_288) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_441| 5) (not (= (ite (and (< .cse5 v_~size~0_288) (<= 0 .cse5)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_280 (* .cse6 4))) v_~x2~0_479) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_301|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| (ite (and (< .cse6 v_~size~0_288) (<= 0 .cse6)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_289|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_289| 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_288)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_481, ~size~0=v_~size~0_288, ~f~0.base=v_~f~0.base_280, #memory_int=|v_#memory_int_370|, ~n~0=v_~n~0_288, ~x1~0=v_~x1~0_504, ~f~0.offset=v_~f~0.offset_280} OutVars{~x2~0=v_~x2~0_479, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_291|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_263|, ~size~0=v_~size~0_288, ~f~0.base=v_~f~0.base_280, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_267|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_393|, ~x1~0=v_~x1~0_502, ~f~0.offset=v_~f~0.offset_280, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_301|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_441|, #memory_int=|v_#memory_int_370|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_289|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_253|, ~n~0=v_~n~0_288, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_253|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_299|} 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 11:13:43,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_362| v_~f~0.base_272))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_272 (* v_~x1~0_480 4))))) (let ((.cse12 (select .cse4 (+ v_~f~0.offset_272 (* .cse8 4))))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_272 (* .cse12 4)))) (.cse5 (select .cse4 (+ v_~f~0.offset_272 (* v_~x2~0_459 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_272 (* .cse5 4)))) (.cse9 (select .cse4 (+ v_~f~0.offset_272 (* .cse11 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_272 (* .cse9 4)))) (.cse6 (select .cse4 (+ v_~f~0.offset_272 (* .cse3 4))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_272 (* .cse6 4)))) (.cse0 (select .cse4 (+ v_~f~0.offset_272 (* .cse10 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_272 (* .cse0 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_272 (* .cse7 4))))) (and (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_379|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_280)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257| (ite (and (< .cse1 v_~size~0_280) (<= 0 .cse1)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| (ite (and (< .cse2 v_~size~0_280) (<= 0 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|) (not (= 0 (ite (and (< .cse3 v_~size~0_280) (<= 0 .cse3)) 1 0))) (= v_~x1~0_478 (select .cse4 (+ v_~f~0.offset_272 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287| 0)) (not (= (ite (and (< .cse5 v_~size~0_280) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273| 0)) (not (= (ite (and (<= 0 v_~x2~0_459) (< v_~x2~0_459 v_~size~0_280)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_280)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_272 (* 4 .cse2))) v_~x2~0_457) (not (= (ite (and (< .cse7 v_~size~0_280) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_280)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_280)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_425| 8) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_425| 4294967294) 4294967296) (* 2 (mod v_~n~0_280 2147483648))) (not (= (ite (and (<= 0 v_~x1~0_480) (< v_~x1~0_480 v_~size~0_280)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_280) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_280) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_280)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_459, ~size~0=v_~size~0_280, ~f~0.base=v_~f~0.base_272, #memory_int=|v_#memory_int_362|, ~n~0=v_~n~0_280, ~x1~0=v_~x1~0_480, ~f~0.offset=v_~f~0.offset_272} OutVars{~x2~0=v_~x2~0_457, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_275|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_249|, ~size~0=v_~size~0_280, ~f~0.base=v_~f~0.base_272, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_253|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_379|, ~x1~0=v_~x1~0_478, ~f~0.offset=v_~f~0.offset_272, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_425|, #memory_int=|v_#memory_int_362|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_239|, ~n~0=v_~n~0_280, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_239|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_283|} 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 11:13:44,687 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:13:44,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2308 [2022-12-13 11:13:44,689 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 255 transitions, 5459 flow [2022-12-13 11:13:44,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:44,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:44,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:44,695 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 11:13:44,889 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 11:13:44,890 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 11:13:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1337497615, now seen corresponding path program 1 times [2022-12-13 11:13:44,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:44,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266805776] [2022-12-13 11:13:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:44,993 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 11:13:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266805776] [2022-12-13 11:13:44,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266805776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:44,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:44,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:13:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568391348] [2022-12-13 11:13:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:44,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:13:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:13:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:13:44,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 11:13:44,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 255 transitions, 5459 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 11:13:44,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:44,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 11:13:44,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:45,700 INFO L130 PetriNetUnfolder]: 1327/2638 cut-off events. [2022-12-13 11:13:45,701 INFO L131 PetriNetUnfolder]: For 104965/104965 co-relation queries the response was YES. [2022-12-13 11:13:45,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27594 conditions, 2638 events. 1327/2638 cut-off events. For 104965/104965 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18425 event pairs, 652 based on Foata normal form. 12/2638 useless extension candidates. Maximal degree in co-relation 27146. Up to 2470 conditions per place. [2022-12-13 11:13:45,729 INFO L137 encePairwiseOnDemand]: 61/70 looper letters, 256 selfloop transitions, 18 changer transitions 7/281 dead transitions. [2022-12-13 11:13:45,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 281 transitions, 6486 flow [2022-12-13 11:13:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:13:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:13:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-13 11:13:45,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2542857142857143 [2022-12-13 11:13:45,730 INFO L175 Difference]: Start difference. First operand has 194 places, 255 transitions, 5459 flow. Second operand 5 states and 89 transitions. [2022-12-13 11:13:45,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 281 transitions, 6486 flow [2022-12-13 11:13:45,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 281 transitions, 6333 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-13 11:13:45,975 INFO L231 Difference]: Finished difference. Result has 194 places, 258 transitions, 5470 flow [2022-12-13 11:13:45,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=5310, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5470, PETRI_PLACES=194, PETRI_TRANSITIONS=258} [2022-12-13 11:13:45,976 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 173 predicate places. [2022-12-13 11:13:45,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:45,976 INFO L89 Accepts]: Start accepts. Operand has 194 places, 258 transitions, 5470 flow [2022-12-13 11:13:45,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:45,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:45,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 258 transitions, 5470 flow [2022-12-13 11:13:45,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 258 transitions, 5470 flow [2022-12-13 11:13:46,116 INFO L130 PetriNetUnfolder]: 310/1106 cut-off events. [2022-12-13 11:13:46,116 INFO L131 PetriNetUnfolder]: For 41795/41889 co-relation queries the response was YES. [2022-12-13 11:13:46,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 1106 events. 310/1106 cut-off events. For 41795/41889 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9590 event pairs, 66 based on Foata normal form. 3/1094 useless extension candidates. Maximal degree in co-relation 10523. Up to 422 conditions per place. [2022-12-13 11:13:46,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 258 transitions, 5470 flow [2022-12-13 11:13:46,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-13 11:13:46,132 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:13:46,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 11:13:46,133 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 5470 flow [2022-12-13 11:13:46,133 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 11:13:46,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:46,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:46,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 11:13:46,134 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 11:13:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1942531187, now seen corresponding path program 1 times [2022-12-13 11:13:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:46,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619140195] [2022-12-13 11:13:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:46,198 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 11:13:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:46,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619140195] [2022-12-13 11:13:46,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619140195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:46,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:46,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:13:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305463888] [2022-12-13 11:13:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:46,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:13:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:46,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:13:46,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:13:46,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-13 11:13:46,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 258 transitions, 5470 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 11:13:46,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:46,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-13 11:13:46,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:46,874 INFO L130 PetriNetUnfolder]: 1305/2574 cut-off events. [2022-12-13 11:13:46,874 INFO L131 PetriNetUnfolder]: For 104305/104305 co-relation queries the response was YES. [2022-12-13 11:13:46,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27612 conditions, 2574 events. 1305/2574 cut-off events. For 104305/104305 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17639 event pairs, 650 based on Foata normal form. 4/2566 useless extension candidates. Maximal degree in co-relation 27224. Up to 2493 conditions per place. [2022-12-13 11:13:46,900 INFO L137 encePairwiseOnDemand]: 61/69 looper letters, 242 selfloop transitions, 23 changer transitions 4/269 dead transitions. [2022-12-13 11:13:46,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 269 transitions, 6200 flow [2022-12-13 11:13:46,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:13:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:13:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 11:13:46,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2971014492753623 [2022-12-13 11:13:46,902 INFO L175 Difference]: Start difference. First operand has 193 places, 258 transitions, 5470 flow. Second operand 4 states and 82 transitions. [2022-12-13 11:13:46,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 269 transitions, 6200 flow [2022-12-13 11:13:47,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 269 transitions, 6085 flow, removed 48 selfloop flow, removed 3 redundant places. [2022-12-13 11:13:47,148 INFO L231 Difference]: Finished difference. Result has 194 places, 259 transitions, 5475 flow [2022-12-13 11:13:47,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=5383, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5475, PETRI_PLACES=194, PETRI_TRANSITIONS=259} [2022-12-13 11:13:47,148 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 173 predicate places. [2022-12-13 11:13:47,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:47,149 INFO L89 Accepts]: Start accepts. Operand has 194 places, 259 transitions, 5475 flow [2022-12-13 11:13:47,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:47,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:47,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 259 transitions, 5475 flow [2022-12-13 11:13:47,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 259 transitions, 5475 flow [2022-12-13 11:13:47,291 INFO L130 PetriNetUnfolder]: 312/1102 cut-off events. [2022-12-13 11:13:47,291 INFO L131 PetriNetUnfolder]: For 39477/39564 co-relation queries the response was YES. [2022-12-13 11:13:47,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10722 conditions, 1102 events. 312/1102 cut-off events. For 39477/39564 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9493 event pairs, 69 based on Foata normal form. 2/1088 useless extension candidates. Maximal degree in co-relation 10460. Up to 417 conditions per place. [2022-12-13 11:13:47,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 259 transitions, 5475 flow [2022-12-13 11:13:47,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 11:13:47,333 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:13:47,334 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-13 11:13:47,334 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 259 transitions, 5475 flow [2022-12-13 11:13:47,334 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 11:13:47,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:47,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:47,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 11:13:47,334 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 11:13:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1556985915, now seen corresponding path program 1 times [2022-12-13 11:13:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463117488] [2022-12-13 11:13:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:47,401 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 11:13:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:47,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463117488] [2022-12-13 11:13:47,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463117488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:47,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:47,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:13:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073489579] [2022-12-13 11:13:47,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:47,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:13:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:13:47,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:13:47,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-13 11:13:47,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 259 transitions, 5475 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 11:13:47,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:47,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-13 11:13:47,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:48,220 INFO L130 PetriNetUnfolder]: 1597/3099 cut-off events. [2022-12-13 11:13:48,221 INFO L131 PetriNetUnfolder]: For 121653/121653 co-relation queries the response was YES. [2022-12-13 11:13:48,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33820 conditions, 3099 events. 1597/3099 cut-off events. For 121653/121653 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 21654 event pairs, 521 based on Foata normal form. 12/3099 useless extension candidates. Maximal degree in co-relation 33372. Up to 1430 conditions per place. [2022-12-13 11:13:48,253 INFO L137 encePairwiseOnDemand]: 36/69 looper letters, 263 selfloop transitions, 69 changer transitions 0/332 dead transitions. [2022-12-13 11:13:48,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 332 transitions, 7666 flow [2022-12-13 11:13:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:13:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:13:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-13 11:13:48,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2584541062801932 [2022-12-13 11:13:48,255 INFO L175 Difference]: Start difference. First operand has 194 places, 259 transitions, 5475 flow. Second operand 6 states and 107 transitions. [2022-12-13 11:13:48,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 332 transitions, 7666 flow [2022-12-13 11:13:48,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 332 transitions, 7525 flow, removed 61 selfloop flow, removed 1 redundant places. [2022-12-13 11:13:48,537 INFO L231 Difference]: Finished difference. Result has 201 places, 270 transitions, 5882 flow [2022-12-13 11:13:48,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=5364, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5882, PETRI_PLACES=201, PETRI_TRANSITIONS=270} [2022-12-13 11:13:48,538 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 180 predicate places. [2022-12-13 11:13:48,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:48,538 INFO L89 Accepts]: Start accepts. Operand has 201 places, 270 transitions, 5882 flow [2022-12-13 11:13:48,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:48,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:48,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 270 transitions, 5882 flow [2022-12-13 11:13:48,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 270 transitions, 5882 flow [2022-12-13 11:13:48,720 INFO L130 PetriNetUnfolder]: 384/1311 cut-off events. [2022-12-13 11:13:48,721 INFO L131 PetriNetUnfolder]: For 50668/50787 co-relation queries the response was YES. [2022-12-13 11:13:48,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13391 conditions, 1311 events. 384/1311 cut-off events. For 50668/50787 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11555 event pairs, 92 based on Foata normal form. 4/1296 useless extension candidates. Maximal degree in co-relation 13104. Up to 540 conditions per place. [2022-12-13 11:13:48,740 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 270 transitions, 5882 flow [2022-12-13 11:13:48,740 INFO L226 LiptonReduction]: Number of co-enabled transitions 722 [2022-12-13 11:13:48,741 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:13:48,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 11:13:48,742 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 270 transitions, 5882 flow [2022-12-13 11:13:48,742 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 11:13:48,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:48,742 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:48,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 11:13:48,742 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 11:13:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1102581051, now seen corresponding path program 1 times [2022-12-13 11:13:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:48,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58387605] [2022-12-13 11:13:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:48,799 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 11:13:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:48,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58387605] [2022-12-13 11:13:48,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58387605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:48,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015778623] [2022-12-13 11:13:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:48,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:13:48,804 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 11:13:48,811 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 11:13:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:48,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 11:13:48,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:48,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:13:48,928 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 11:13:48,932 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 11:13:48,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:13:48,967 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 11:13:49,091 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-12-13 11:13:49,092 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 79 treesize of output 48 [2022-12-13 11:13:49,129 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 11:13:49,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:49,361 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 11:13:49,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015778623] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:49,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:49,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-13 11:13:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560969884] [2022-12-13 11:13:49,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:49,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:13:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:49,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:13:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:13:49,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-13 11:13:49,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 270 transitions, 5882 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 11:13:49,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:49,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-13 11:13:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:51,987 INFO L130 PetriNetUnfolder]: 1723/3316 cut-off events. [2022-12-13 11:13:51,987 INFO L131 PetriNetUnfolder]: For 148994/148994 co-relation queries the response was YES. [2022-12-13 11:13:52,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37369 conditions, 3316 events. 1723/3316 cut-off events. For 148994/148994 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 23249 event pairs, 305 based on Foata normal form. 18/3330 useless extension candidates. Maximal degree in co-relation 36701. Up to 2720 conditions per place. [2022-12-13 11:13:52,081 INFO L137 encePairwiseOnDemand]: 21/69 looper letters, 228 selfloop transitions, 117 changer transitions 12/357 dead transitions. [2022-12-13 11:13:52,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 357 transitions, 8265 flow [2022-12-13 11:13:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:13:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 11:13:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2022-12-13 11:13:52,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13554987212276215 [2022-12-13 11:13:52,083 INFO L175 Difference]: Start difference. First operand has 201 places, 270 transitions, 5882 flow. Second operand 17 states and 159 transitions. [2022-12-13 11:13:52,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 357 transitions, 8265 flow [2022-12-13 11:13:52,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 357 transitions, 8119 flow, removed 73 selfloop flow, removed 0 redundant places. [2022-12-13 11:13:52,390 INFO L231 Difference]: Finished difference. Result has 226 places, 297 transitions, 7007 flow [2022-12-13 11:13:52,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=5800, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7007, PETRI_PLACES=226, PETRI_TRANSITIONS=297} [2022-12-13 11:13:52,390 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 205 predicate places. [2022-12-13 11:13:52,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:52,391 INFO L89 Accepts]: Start accepts. Operand has 226 places, 297 transitions, 7007 flow [2022-12-13 11:13:52,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:52,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:52,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 297 transitions, 7007 flow [2022-12-13 11:13:52,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 297 transitions, 7007 flow [2022-12-13 11:13:52,604 INFO L130 PetriNetUnfolder]: 422/1410 cut-off events. [2022-12-13 11:13:52,604 INFO L131 PetriNetUnfolder]: For 60174/60356 co-relation queries the response was YES. [2022-12-13 11:13:52,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15213 conditions, 1410 events. 422/1410 cut-off events. For 60174/60356 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12552 event pairs, 100 based on Foata normal form. 3/1387 useless extension candidates. Maximal degree in co-relation 14906. Up to 600 conditions per place. [2022-12-13 11:13:52,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 297 transitions, 7007 flow [2022-12-13 11:13:52,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-13 11:13:52,641 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 11:13:52,948 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 11:13:53,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_396| v_~f~0.base_304))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_304 (* v_~x1~0_559 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_304 (* .cse5 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_304 (* v_~x2~0_545 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_304 (* .cse0 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_304 (* .cse2 4)))) (.cse6 (select .cse3 (+ v_~f~0.offset_304 (* .cse1 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_304 (* .cse6 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_304 (* .cse8 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_312) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_312) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344| 0)) (not (= (ite (and (< .cse2 v_~size~0_312) (<= 0 .cse2)) 1 0) 0)) (= v_~x1~0_557 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse4)))) (not (= (ite (and (<= 0 v_~x1~0_559) (< v_~x1~0_559 v_~size~0_312)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_436| 4) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_312)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_479| 4294967294) 4294967296) (* 2 (mod v_~n~0_312 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_479| 6) (not (= (ite (and (<= 0 v_~x2~0_545) (< v_~x2~0_545 v_~size~0_312)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_312)) 1 0) 0)) (= v_~x2~0_544 (select .cse3 (+ v_~f~0.offset_304 (* .cse7 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|) (not (= (ite (and (< .cse8 v_~size~0_312) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320| (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_312)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_308| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324|) (= (ite (and (< .cse4 v_~size~0_312) (<= 0 .cse4)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_308|)))))))) InVars {~x2~0=v_~x2~0_545, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, #memory_int=|v_#memory_int_396|, ~n~0=v_~n~0_312, ~x1~0=v_~x1~0_559, ~f~0.offset=v_~f~0.offset_304} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_326|, ~x2~0=v_~x2~0_544, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_306|, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_310|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_436|, ~x1~0=v_~x1~0_557, ~f~0.offset=v_~f~0.offset_304, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_308|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_479|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324|, #memory_int=|v_#memory_int_396|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_296|, ~n~0=v_~n~0_312, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_334|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_296|} 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 11:13:53,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_380| v_~f~0.base_290))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_290 (* v_~x2~0_510 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_290 (* v_~x1~0_525 4))))) (and (= (select .cse0 (+ v_~f~0.offset_290 (* 4 .cse1))) v_~x2~0_509) (not (= (ite (and (<= 0 v_~x1~0_525) (< v_~x1~0_525 v_~size~0_298)) 1 0) 0)) (= v_~x1~0_524 (select .cse0 (+ v_~f~0.offset_290 (* .cse2 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_297| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_298)) 1 0)) (= (ite (and (< .cse2 v_~size~0_298) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_413|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_321| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303| 0)) (< 1 (* 2 (mod v_~n~0_298 2147483648))) (not (= (ite (and (< v_~x2~0_510 v_~size~0_298) (<= 0 v_~x2~0_510)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_297| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_321|) (= |v_thread1Thread1of1ForFork0_~i~0#1_455| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303|)))) InVars {~x2~0=v_~x2~0_510, ~size~0=v_~size~0_298, ~f~0.base=v_~f~0.base_290, #memory_int=|v_#memory_int_380|, ~n~0=v_~n~0_298, ~x1~0=v_~x1~0_525, ~f~0.offset=v_~f~0.offset_290} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_305|, ~x2~0=v_~x2~0_509, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_283|, ~size~0=v_~size~0_298, ~f~0.base=v_~f~0.base_290, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_287|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_297|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_413|, ~x1~0=v_~x1~0_524, ~f~0.offset=v_~f~0.offset_290, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_321|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_455|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303|, #memory_int=|v_#memory_int_380|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_273|, ~n~0=v_~n~0_298, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_313|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_273|} 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 11:13:54,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_175| v_~f~0.base_104))) (let ((.cse0 (select .cse1 (+ (* v_~x1~0_138 4) v_~f~0.offset_104)))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_104 (* 4 .cse0))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_124| 4294967295) 4294967296) (* (mod v_~n~0_114 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_124| 3) (not (= 0 (ite (and (<= 0 v_~x1~0_138) (< v_~x1~0_138 v_~size~0_114)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_104 (* .cse2 4))) v_~x1~0_136) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|))))) InVars {~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_114, ~x1~0=v_~x1~0_138, ~f~0.offset=v_~f~0.offset_104} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_72|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_104, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_124|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_114, ~x1~0=v_~x1~0_136, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_80|, ~f~0.offset=v_~f~0.offset_104} AuxVars[] 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 [632] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_130 (* v_~x2~0_137 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_130 (* .cse0 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_130 (* .cse1 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (not (= (ite (and (< .cse0 v_~size~0_140) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_140)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 v_~x2~0_137) (< v_~x2~0_137 v_~size~0_140)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_140 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= (select .cse3 (+ v_~f~0.offset_130 (* .cse2 4))) v_~x2~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|)))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, #memory_int=|v_#memory_int_207|, ~n~0=v_~n~0_140, ~f~0.offset=v_~f~0.offset_130} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_140, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 11:13:54,781 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_175| v_~f~0.base_104))) (let ((.cse0 (select .cse1 (+ (* v_~x1~0_138 4) v_~f~0.offset_104)))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_104 (* 4 .cse0))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_124| 4294967295) 4294967296) (* (mod v_~n~0_114 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_124| 3) (not (= 0 (ite (and (<= 0 v_~x1~0_138) (< v_~x1~0_138 v_~size~0_114)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_104 (* .cse2 4))) v_~x1~0_136) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|))))) InVars {~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_114, ~x1~0=v_~x1~0_138, ~f~0.offset=v_~f~0.offset_104} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_72|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_104, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_124|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_114, ~x1~0=v_~x1~0_136, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_80|, ~f~0.offset=v_~f~0.offset_104} AuxVars[] 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 11:13:54,890 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:13:54,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2502 [2022-12-13 11:13:54,892 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 297 transitions, 7127 flow [2022-12-13 11:13:54,892 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 11:13:54,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:54,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:54,899 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 11:13:55,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:55,095 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 11:13:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2085059987, now seen corresponding path program 1 times [2022-12-13 11:13:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:55,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716204595] [2022-12-13 11:13:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:55,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:57,935 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 11:13:57,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:57,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716204595] [2022-12-13 11:13:57,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716204595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:57,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:57,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:13:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380313889] [2022-12-13 11:13:57,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:57,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:13:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:13:57,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:13:57,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-13 11:13:57,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 297 transitions, 7127 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:57,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:57,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-13 11:13:57,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:59,754 INFO L130 PetriNetUnfolder]: 1741/3351 cut-off events. [2022-12-13 11:13:59,754 INFO L131 PetriNetUnfolder]: For 162528/162528 co-relation queries the response was YES. [2022-12-13 11:13:59,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38882 conditions, 3351 events. 1741/3351 cut-off events. For 162528/162528 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 23658 event pairs, 822 based on Foata normal form. 1/3348 useless extension candidates. Maximal degree in co-relation 38204. Up to 3204 conditions per place. [2022-12-13 11:13:59,792 INFO L137 encePairwiseOnDemand]: 34/77 looper letters, 247 selfloop transitions, 65 changer transitions 8/320 dead transitions. [2022-12-13 11:13:59,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 320 transitions, 8072 flow [2022-12-13 11:13:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:13:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:13:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-13 11:13:59,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19666048237476808 [2022-12-13 11:13:59,793 INFO L175 Difference]: Start difference. First operand has 226 places, 297 transitions, 7127 flow. Second operand 7 states and 106 transitions. [2022-12-13 11:13:59,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 320 transitions, 8072 flow [2022-12-13 11:14:00,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 320 transitions, 7685 flow, removed 165 selfloop flow, removed 6 redundant places. [2022-12-13 11:14:00,187 INFO L231 Difference]: Finished difference. Result has 227 places, 299 transitions, 7010 flow [2022-12-13 11:14:00,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=6746, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7010, PETRI_PLACES=227, PETRI_TRANSITIONS=299} [2022-12-13 11:14:00,188 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2022-12-13 11:14:00,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:00,188 INFO L89 Accepts]: Start accepts. Operand has 227 places, 299 transitions, 7010 flow [2022-12-13 11:14:00,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:00,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:00,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 299 transitions, 7010 flow [2022-12-13 11:14:00,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 299 transitions, 7010 flow [2022-12-13 11:14:00,446 INFO L130 PetriNetUnfolder]: 427/1423 cut-off events. [2022-12-13 11:14:00,446 INFO L131 PetriNetUnfolder]: For 59984/60157 co-relation queries the response was YES. [2022-12-13 11:14:00,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15309 conditions, 1423 events. 427/1423 cut-off events. For 59984/60157 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12699 event pairs, 102 based on Foata normal form. 1/1400 useless extension candidates. Maximal degree in co-relation 14998. Up to 607 conditions per place. [2022-12-13 11:14:00,471 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 299 transitions, 7010 flow [2022-12-13 11:14:00,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-13 11:14:00,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_229| v_~f~0.base_144))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_144 (* v_~x2~0_163 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_144 (* .cse3 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_144 (* .cse0 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_108| 0)) (not (= (ite (and (< v_~x2~0_163 v_~size~0_152) (<= 0 v_~x2~0_163)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_152)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_144 (* .cse2 4))) v_~x2~0_161) (= |v_thread2Thread1of1ForFork1_~i~1#1_119| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_108| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (not (= (ite (and (< .cse3 v_~size~0_152) (<= 0 .cse3)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_152)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (< 2 (* 2 (mod v_~n~0_152 2147483648)))))))) InVars {~x2~0=v_~x2~0_163, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_144, #memory_int=|v_#memory_int_229|, ~n~0=v_~n~0_152, ~f~0.offset=v_~f~0.offset_144} OutVars{~x2~0=v_~x2~0_161, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_70|, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_74|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_108|, #memory_int=|v_#memory_int_229|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_60|, ~n~0=v_~n~0_152, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_60|} 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 [771] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_407| v_~f~0.base_312))) (let ((.cse1 (* (mod v_~n~0_320 2147483648) 2)) (.cse0 (select .cse2 (+ v_~f~0.offset_312 (* v_~x2~0_559 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_328| (ite (and (< .cse0 v_~size~0_320) (<= 0 .cse0)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_501| 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_328| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_352|) (= |v_thread1Thread1of1ForFork0_~i~0#1_500| (+ |v_thread1Thread1of1ForFork0_~i~0#1_501| 1)) (= |v_thread2Thread1of1ForFork1_~i~1#1_446| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_447|)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341| 0)) (= (select .cse2 (+ v_~f~0.offset_312 (* v_~x1~0_584 4))) v_~x1~0_583) (= (ite (and (<= 0 v_~x1~0_584) (< v_~x1~0_584 v_~size~0_320)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_352| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_447| 4294967296) .cse1) (not (= (ite (and (<= 0 v_~x2~0_559) (< v_~x2~0_559 v_~size~0_320)) 1 0) 0)) (= v_~x2~0_558 (select .cse2 (+ v_~f~0.offset_312 (* .cse0 4))))))) InVars {~x2~0=v_~x2~0_559, ~size~0=v_~size~0_320, ~f~0.base=v_~f~0.base_312, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_407|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_447|, ~n~0=v_~n~0_320, ~x1~0=v_~x1~0_584, ~f~0.offset=v_~f~0.offset_312} OutVars{~x2~0=v_~x2~0_558, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_343|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_314|, ~size~0=v_~size~0_320, ~f~0.base=v_~f~0.base_312, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_318|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_328|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_446|, ~x1~0=v_~x1~0_583, ~f~0.offset=v_~f~0.offset_312, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_352|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_500|, #memory_int=|v_#memory_int_407|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_304|, ~n~0=v_~n~0_320, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_304|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_351|} 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 11:14:00,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [751] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_378| v_~f~0.base_288))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_288 (* v_~x2~0_505 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_288 (* 4 .cse0))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_288 (* .cse1 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_296)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_317| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_317|) (= |v_thread2Thread1of1ForFork1_~i~1#1_409| 4) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_409|) 4294967296) (* (mod v_~n~0_296 2147483648) 2)) (not (= 0 (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_296)) 1 0))) (= (select .cse2 (+ v_~f~0.offset_288 (* .cse3 4))) v_~x2~0_503) (= (ite (and (< .cse3 v_~size~0_296) (<= 0 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|) (not (= (ite (and (<= 0 v_~x2~0_505) (< v_~x2~0_505 v_~size~0_296)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_505, ~size~0=v_~size~0_296, ~f~0.base=v_~f~0.base_288, #memory_int=|v_#memory_int_378|, ~n~0=v_~n~0_296, ~f~0.offset=v_~f~0.offset_288} OutVars{~x2~0=v_~x2~0_503, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_279|, ~size~0=v_~size~0_296, ~f~0.base=v_~f~0.base_288, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_283|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_409|, ~f~0.offset=v_~f~0.offset_288, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_317|, #memory_int=|v_#memory_int_378|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_269|, ~n~0=v_~n~0_296, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_269|} 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 [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:14:01,415 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:14:01,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1228 [2022-12-13 11:14:01,416 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 299 transitions, 7037 flow [2022-12-13 11:14:01,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:01,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:01,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:01,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 11:14:01,417 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 11:14:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 941141236, now seen corresponding path program 1 times [2022-12-13 11:14:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:01,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387420501] [2022-12-13 11:14:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:01,482 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 11:14:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:01,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387420501] [2022-12-13 11:14:01,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387420501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:01,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:01,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:14:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004886181] [2022-12-13 11:14:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:01,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:14:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:14:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:14:01,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-13 11:14:01,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 299 transitions, 7037 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 11:14:01,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:01,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-13 11:14:01,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:02,501 INFO L130 PetriNetUnfolder]: 1808/3588 cut-off events. [2022-12-13 11:14:02,501 INFO L131 PetriNetUnfolder]: For 166130/166130 co-relation queries the response was YES. [2022-12-13 11:14:02,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40766 conditions, 3588 events. 1808/3588 cut-off events. For 166130/166130 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 26996 event pairs, 309 based on Foata normal form. 8/3592 useless extension candidates. Maximal degree in co-relation 40082. Up to 1729 conditions per place. [2022-12-13 11:14:02,539 INFO L137 encePairwiseOnDemand]: 56/79 looper letters, 374 selfloop transitions, 54 changer transitions 6/434 dead transitions. [2022-12-13 11:14:02,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 434 transitions, 10933 flow [2022-12-13 11:14:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:14:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:14:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 11:14:02,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27341772151898736 [2022-12-13 11:14:02,541 INFO L175 Difference]: Start difference. First operand has 226 places, 299 transitions, 7037 flow. Second operand 5 states and 108 transitions. [2022-12-13 11:14:02,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 434 transitions, 10933 flow [2022-12-13 11:14:02,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 434 transitions, 10738 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-12-13 11:14:02,996 INFO L231 Difference]: Finished difference. Result has 227 places, 327 transitions, 7827 flow [2022-12-13 11:14:02,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=6858, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7827, PETRI_PLACES=227, PETRI_TRANSITIONS=327} [2022-12-13 11:14:02,997 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2022-12-13 11:14:02,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:02,997 INFO L89 Accepts]: Start accepts. Operand has 227 places, 327 transitions, 7827 flow [2022-12-13 11:14:02,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:02,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:02,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 327 transitions, 7827 flow [2022-12-13 11:14:03,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 327 transitions, 7827 flow [2022-12-13 11:14:03,262 INFO L130 PetriNetUnfolder]: 437/1546 cut-off events. [2022-12-13 11:14:03,262 INFO L131 PetriNetUnfolder]: For 70040/70215 co-relation queries the response was YES. [2022-12-13 11:14:03,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16874 conditions, 1546 events. 437/1546 cut-off events. For 70040/70215 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14454 event pairs, 84 based on Foata normal form. 1/1523 useless extension candidates. Maximal degree in co-relation 16559. Up to 649 conditions per place. [2022-12-13 11:14:03,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 327 transitions, 7827 flow [2022-12-13 11:14:03,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-13 11:14:03,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_159| v_~f~0.base_94))) (let ((.cse2 (select .cse1 (+ (* v_~x1~0_122 4) v_~f~0.offset_94)))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_94 (* .cse2 4)))) (.cse3 (* (mod v_~n~0_106 2147483648) 2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= v_~x1~0_120 (select .cse1 (+ v_~f~0.offset_94 (* .cse0 4)))) (not (= (ite (and (< .cse2 v_~size~0_106) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_122) (< v_~x1~0_122 v_~size~0_106)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 2) 4294967296) .cse3) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967296) .cse3) (= |v_thread1Thread1of1ForFork0_~i~0#1_112| (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 3)))))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_122, ~f~0.offset=v_~f~0.offset_94} 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_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_120, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_94} AuxVars[] 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 [692] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_313| v_~f~0.base_226))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_226 (* v_~x2~0_338 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_226 (* .cse0 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_226 (* .cse3 4)))) (.cse4 (* (mod v_~n~0_234 2147483648) 2))) (and (not (= 0 (ite (and (< .cse0 v_~size~0_234) (<= 0 .cse0)) 1 0))) (= v_~x2~0_336 (select .cse1 (+ v_~f~0.offset_226 (* .cse2 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_234)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_234)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_272|) 4294967296) .cse4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209| 0)) (not (= (ite (and (< v_~x2~0_338 v_~size~0_234) (<= 0 v_~x2~0_338)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_274| 4) |v_thread2Thread1of1ForFork1_~i~1#1_272|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_274| 4294967296) .cse4)))))) InVars {~x2~0=v_~x2~0_338, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_274|, ~n~0=v_~n~0_234, ~f~0.offset=v_~f~0.offset_226} OutVars{~x2~0=v_~x2~0_336, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_171|, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_175|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_272|, ~f~0.offset=v_~f~0.offset_226, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_161|, ~n~0=v_~n~0_234, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_161|} 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 11:14:03,791 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_333| v_~f~0.base_246))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_246 (* v_~x2~0_386 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_246 (* .cse7 4))))) (let ((.cse2 (select .cse0 (+ (* v_~x1~0_407 4) v_~f~0.offset_246))) (.cse3 (select .cse0 (+ v_~f~0.offset_246 (* .cse8 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_246 (* .cse3 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_246 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ (* .cse4 4) v_~f~0.offset_246))) (.cse5 (select .cse0 (+ v_~f~0.offset_246 (* .cse6 4))))) (and (= (select .cse0 (+ v_~f~0.offset_246 (* .cse1 4))) v_~x1~0_406) (not (= (ite (and (< v_~x1~0_407 v_~size~0_254) (<= 0 v_~x1~0_407)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_254)) 1 0)) (not (= (ite (and (< v_~x2~0_386 v_~size~0_254) (<= 0 v_~x2~0_386)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_364| 4) (not (= (ite (and (< .cse2 v_~size~0_254) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_254)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_318|) (not (= (ite (and (< .cse4 v_~size~0_254) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_228| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_215| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|) (= (select .cse0 (+ v_~f~0.offset_246 (* .cse5 4))) v_~x2~0_384) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_215| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_254)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_228|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_254)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_318|) 4294967296) (* (mod v_~n~0_254 2147483648) 2)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_254)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_386, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_246, #memory_int=|v_#memory_int_333|, ~n~0=v_~n~0_254, ~x1~0=v_~x1~0_407, ~f~0.offset=v_~f~0.offset_246} OutVars{~x2~0=v_~x2~0_384, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_230|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_201|, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_246, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_205|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_215|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_318|, ~x1~0=v_~x1~0_406, ~f~0.offset=v_~f~0.offset_246, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_364|, #memory_int=|v_#memory_int_333|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_228|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_191|, ~n~0=v_~n~0_254, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_191|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_238|} 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 11:14:04,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_223| v_~f~0.base_140))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_140 (* v_~x2~0_151 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_140 (* .cse4 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_140 (* v_~x1~0_223 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_140 (* .cse0 4))))) (and (not (= (ite (and (< v_~x2~0_151 v_~size~0_148) (<= 0 v_~x2~0_151)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_100| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_123|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_148)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_140 (* .cse2 4))) v_~x2~0_149) (= |v_thread1Thread1of1ForFork0_~i~0#1_179| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_100| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76|) (not (= (ite (and (< v_~x1~0_223 v_~size~0_148) (<= 0 v_~x1~0_223)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_123| 0)) (= (select .cse1 (+ v_~f~0.offset_140 (* .cse3 4))) v_~x1~0_222) (= |v_thread2Thread1of1ForFork1_~i~1#1_111| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_148)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_111|) 4294967296) (* 2 (mod v_~n~0_148 2147483648))) (= (ite (and (< .cse2 v_~size~0_148) (<= 0 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76|) (not (= (ite (and (< .cse4 v_~size~0_148) (<= 0 .cse4)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_151, ~size~0=v_~size~0_148, ~f~0.base=v_~f~0.base_140, #memory_int=|v_#memory_int_223|, ~n~0=v_~n~0_148, ~x1~0=v_~x1~0_223, ~f~0.offset=v_~f~0.offset_140} OutVars{~x2~0=v_~x2~0_149, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_125|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_62|, ~size~0=v_~size~0_148, ~f~0.base=v_~f~0.base_140, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_66|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_111|, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_179|, #memory_int=|v_#memory_int_223|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_52|, ~n~0=v_~n~0_148, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_52|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_133|} 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 11:14:04,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_341| v_~f~0.base_254))) (let ((.cse8 (select .cse2 (+ v_~f~0.offset_254 (* v_~x2~0_410 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_254 (* 4 .cse8))))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_254 (* 4 .cse0))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_254 (* .cse10 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_254 (* v_~x1~0_427 4)))) (.cse9 (select .cse2 (+ v_~f~0.offset_254 (* .cse6 4))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_254 (* .cse9 4)))) (.cse1 (select .cse2 (+ (* .cse5 4) v_~f~0.offset_254)))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_254 (* .cse1 4)))) (.cse3 (select .cse2 (+ (* .cse7 4) v_~f~0.offset_254)))) (and (not (= (ite (and (< .cse0 v_~size~0_262) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_262) (<= 0 .cse1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_255| 0)) (not (= 0 (ite (and (< v_~x2~0_410 v_~size~0_262) (<= 0 v_~x2~0_410)) 1 0))) (= (select .cse2 (+ v_~f~0.offset_254 (* .cse3 4))) v_~x2~0_408) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240| 0)) (= v_~x1~0_426 (select .cse2 (+ v_~f~0.offset_254 (* 4 .cse4)))) (not (= (ite (and (<= 0 v_~x1~0_427) (< v_~x1~0_427 v_~size~0_262)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_262)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_262)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_224| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_262)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_340| 8) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|) (not (= (ite (and (< .cse7 v_~size~0_262) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_224| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_262)) 1 0) 0)) (< 6 (* 2 (mod v_~n~0_262 2147483648))) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_262)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (and (< .cse3 v_~size~0_262) (<= 0 .cse3)) 1 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_262)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_410, ~size~0=v_~size~0_262, ~f~0.base=v_~f~0.base_254, #memory_int=|v_#memory_int_341|, ~n~0=v_~n~0_262, ~x1~0=v_~x1~0_427, ~f~0.offset=v_~f~0.offset_254} OutVars{~x2~0=v_~x2~0_408, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_242|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_217|, ~size~0=v_~size~0_262, ~f~0.base=v_~f~0.base_254, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_221|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_340|, ~x1~0=v_~x1~0_426, ~f~0.offset=v_~f~0.offset_254, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_224|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, #memory_int=|v_#memory_int_341|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_207|, ~n~0=v_~n~0_262, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_207|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_250|} 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 11:14:05,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [739] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_366| v_~f~0.base_276))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_276 (* v_~x1~0_492 4)))) (.cse0 (select .cse6 (+ v_~f~0.offset_276 (* v_~x2~0_469 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_276 (* 4 .cse0)))) (.cse2 (select .cse6 (+ v_~f~0.offset_276 (* .cse3 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_276 (* .cse2 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_276 (* .cse5 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_284)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_284)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|) (< 2 (* 2 (mod v_~n~0_284 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_284) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_385| 4) (not (= (ite (and (< .cse3 v_~size~0_284) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_433| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265| (ite (and (< .cse4 v_~size~0_284) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_284) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= v_~x1~0_490 (select .cse6 (+ v_~f~0.offset_276 (* .cse4 4)))) (not (= (ite (and (<= 0 v_~x2~0_469) (< v_~x2~0_469 v_~size~0_284)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281| 0)) (= v_~x2~0_467 (select .cse6 (+ (* .cse1 4) v_~f~0.offset_276))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< v_~x1~0_492 v_~size~0_284) (<= 0 v_~x1~0_492)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_469, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, #memory_int=|v_#memory_int_366|, ~n~0=v_~n~0_284, ~x1~0=v_~x1~0_492, ~f~0.offset=v_~f~0.offset_276} OutVars{~x2~0=v_~x2~0_467, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_283|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_385|, ~x1~0=v_~x1~0_490, ~f~0.offset=v_~f~0.offset_276, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_433|, #memory_int=|v_#memory_int_366|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_284, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_291|} 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 11:14:06,220 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [739] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_366| v_~f~0.base_276))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_276 (* v_~x1~0_492 4)))) (.cse0 (select .cse6 (+ v_~f~0.offset_276 (* v_~x2~0_469 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_276 (* 4 .cse0)))) (.cse2 (select .cse6 (+ v_~f~0.offset_276 (* .cse3 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_276 (* .cse2 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_276 (* .cse5 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_284)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_284)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|) (< 2 (* 2 (mod v_~n~0_284 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_284) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_385| 4) (not (= (ite (and (< .cse3 v_~size~0_284) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_433| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265| (ite (and (< .cse4 v_~size~0_284) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_284) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= v_~x1~0_490 (select .cse6 (+ v_~f~0.offset_276 (* .cse4 4)))) (not (= (ite (and (<= 0 v_~x2~0_469) (< v_~x2~0_469 v_~size~0_284)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281| 0)) (= v_~x2~0_467 (select .cse6 (+ (* .cse1 4) v_~f~0.offset_276))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< v_~x1~0_492 v_~size~0_284) (<= 0 v_~x1~0_492)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_469, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, #memory_int=|v_#memory_int_366|, ~n~0=v_~n~0_284, ~x1~0=v_~x1~0_492, ~f~0.offset=v_~f~0.offset_276} OutVars{~x2~0=v_~x2~0_467, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_283|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_385|, ~x1~0=v_~x1~0_490, ~f~0.offset=v_~f~0.offset_276, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_433|, #memory_int=|v_#memory_int_366|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_284, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_291|} 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 [603] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (* (mod v_~n~0_104 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_116 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 2) |v_thread1Thread1of1ForFork0_~i~0#1_106|) (= v_~x1~0_114 (select .cse1 (+ (* .cse2 4) v_~f~0.offset_92))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 1) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_116 v_~size~0_104) (<= 0 v_~x1~0_116)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_104)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|)))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_116, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_60|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_104, ~x1~0=v_~x1~0_114, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_68|, ~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] [2022-12-13 11:14:06,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [739] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_366| v_~f~0.base_276))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_276 (* v_~x1~0_492 4)))) (.cse0 (select .cse6 (+ v_~f~0.offset_276 (* v_~x2~0_469 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_276 (* 4 .cse0)))) (.cse2 (select .cse6 (+ v_~f~0.offset_276 (* .cse3 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_276 (* .cse2 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_276 (* .cse5 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_284)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_284)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|) (< 2 (* 2 (mod v_~n~0_284 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_284) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_385| 4) (not (= (ite (and (< .cse3 v_~size~0_284) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_433| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265| (ite (and (< .cse4 v_~size~0_284) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_284) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= v_~x1~0_490 (select .cse6 (+ v_~f~0.offset_276 (* .cse4 4)))) (not (= (ite (and (<= 0 v_~x2~0_469) (< v_~x2~0_469 v_~size~0_284)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281| 0)) (= v_~x2~0_467 (select .cse6 (+ (* .cse1 4) v_~f~0.offset_276))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< v_~x1~0_492 v_~size~0_284) (<= 0 v_~x1~0_492)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_469, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, #memory_int=|v_#memory_int_366|, ~n~0=v_~n~0_284, ~x1~0=v_~x1~0_492, ~f~0.offset=v_~f~0.offset_276} OutVars{~x2~0=v_~x2~0_467, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_283|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_385|, ~x1~0=v_~x1~0_490, ~f~0.offset=v_~f~0.offset_276, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_265|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_433|, #memory_int=|v_#memory_int_366|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_284, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_291|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [605] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_159| v_~f~0.base_94))) (let ((.cse2 (select .cse1 (+ (* v_~x1~0_122 4) v_~f~0.offset_94)))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_94 (* .cse2 4)))) (.cse3 (* (mod v_~n~0_106 2147483648) 2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (= v_~x1~0_120 (select .cse1 (+ v_~f~0.offset_94 (* .cse0 4)))) (not (= (ite (and (< .cse2 v_~size~0_106) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_122) (< v_~x1~0_122 v_~size~0_106)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 2) 4294967296) .cse3) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967296) .cse3) (= |v_thread1Thread1of1ForFork0_~i~0#1_112| (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 3)))))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_122, ~f~0.offset=v_~f~0.offset_94} 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_106, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_159|, ~n~0=v_~n~0_106, ~x1~0=v_~x1~0_120, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_94} AuxVars[] 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 11:14:07,456 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:14:07,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4460 [2022-12-13 11:14:07,457 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 328 transitions, 8010 flow [2022-12-13 11:14:07,457 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 11:14:07,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:07,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:07,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 11:14:07,457 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 11:14:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 986611906, now seen corresponding path program 1 times [2022-12-13 11:14:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:07,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865295198] [2022-12-13 11:14:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:08,842 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 11:14:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:08,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865295198] [2022-12-13 11:14:08,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865295198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:08,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300799263] [2022-12-13 11:14:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:08,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:08,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:14:08,844 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 11:14:08,846 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 11:14:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:08,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 11:14:08,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:08,986 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 11:14:09,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:09,051 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 11:14:09,083 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 11:14:09,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:09,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:09,299 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 11:14:09,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:09,372 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 11:14:13,317 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 11:14:13,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300799263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:13,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:13,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 11:14:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407527447] [2022-12-13 11:14:13,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:13,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:14:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:14:13,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:14:13,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 86 [2022-12-13 11:14:13,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 328 transitions, 8010 flow. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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 11:14:13,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:13,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 86 [2022-12-13 11:14:13,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:16,454 INFO L130 PetriNetUnfolder]: 1865/3684 cut-off events. [2022-12-13 11:14:16,454 INFO L131 PetriNetUnfolder]: For 196288/196288 co-relation queries the response was YES. [2022-12-13 11:14:16,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43237 conditions, 3684 events. 1865/3684 cut-off events. For 196288/196288 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 27301 event pairs, 707 based on Foata normal form. 3/3683 useless extension candidates. Maximal degree in co-relation 42328. Up to 3144 conditions per place. [2022-12-13 11:14:16,490 INFO L137 encePairwiseOnDemand]: 30/86 looper letters, 252 selfloop transitions, 147 changer transitions 13/412 dead transitions. [2022-12-13 11:14:16,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 412 transitions, 10188 flow [2022-12-13 11:14:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:14:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 11:14:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 164 transitions. [2022-12-13 11:14:16,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12713178294573643 [2022-12-13 11:14:16,492 INFO L175 Difference]: Start difference. First operand has 227 places, 328 transitions, 8010 flow. Second operand 15 states and 164 transitions. [2022-12-13 11:14:16,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 412 transitions, 10188 flow [2022-12-13 11:14:16,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 412 transitions, 9898 flow, removed 140 selfloop flow, removed 2 redundant places. [2022-12-13 11:14:16,915 INFO L231 Difference]: Finished difference. Result has 244 places, 360 transitions, 8960 flow [2022-12-13 11:14:16,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=7718, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8960, PETRI_PLACES=244, PETRI_TRANSITIONS=360} [2022-12-13 11:14:16,916 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 223 predicate places. [2022-12-13 11:14:16,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:16,916 INFO L89 Accepts]: Start accepts. Operand has 244 places, 360 transitions, 8960 flow [2022-12-13 11:14:16,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:16,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:16,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 360 transitions, 8960 flow [2022-12-13 11:14:16,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 360 transitions, 8960 flow [2022-12-13 11:14:17,152 INFO L130 PetriNetUnfolder]: 447/1587 cut-off events. [2022-12-13 11:14:17,152 INFO L131 PetriNetUnfolder]: For 74277/74428 co-relation queries the response was YES. [2022-12-13 11:14:17,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17600 conditions, 1587 events. 447/1587 cut-off events. For 74277/74428 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14967 event pairs, 88 based on Foata normal form. 1/1568 useless extension candidates. Maximal degree in co-relation 17220. Up to 661 conditions per place. [2022-12-13 11:14:17,175 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 360 transitions, 8960 flow [2022-12-13 11:14:17,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 946 [2022-12-13 11:14:17,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_191| v_~f~0.base_116))) (let ((.cse2 (select .cse1 (+ (* v_~x1~0_168 4) v_~f~0.offset_116)))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_116 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| 0)) (not (= (ite (and (< v_~x1~0_168 v_~size~0_126) (<= 0 v_~x1~0_168)) 1 0) 0)) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_126)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_142| 4294967295) 4294967296) (* 2 (mod v_~n~0_126 2147483648))) (= (select .cse1 (+ v_~f~0.offset_116 (* 4 .cse0))) v_~x1~0_166) (= |v_thread1Thread1of1ForFork0_~i~0#1_142| 3) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_126)) 1 0) 0)))))) InVars {~size~0=v_~size~0_126, ~f~0.base=v_~f~0.base_116, #memory_int=|v_#memory_int_191|, ~n~0=v_~n~0_126, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_116} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_90|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|, ~size~0=v_~size~0_126, ~f~0.base=v_~f~0.base_116, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_142|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88|, #memory_int=|v_#memory_int_191|, ~n~0=v_~n~0_126, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_98|, ~f~0.offset=v_~f~0.offset_116} AuxVars[] 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 [632] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_130 (* v_~x2~0_137 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_130 (* .cse0 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_130 (* .cse1 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (not (= (ite (and (< .cse0 v_~size~0_140) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_140)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 v_~x2~0_137) (< v_~x2~0_137 v_~size~0_140)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_140 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= (select .cse3 (+ v_~f~0.offset_130 (* .cse2 4))) v_~x2~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|)))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, #memory_int=|v_#memory_int_207|, ~n~0=v_~n~0_140, ~f~0.offset=v_~f~0.offset_130} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_140, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 11:14:17,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_191| v_~f~0.base_116))) (let ((.cse2 (select .cse1 (+ (* v_~x1~0_168 4) v_~f~0.offset_116)))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_116 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| 0)) (not (= (ite (and (< v_~x1~0_168 v_~size~0_126) (<= 0 v_~x1~0_168)) 1 0) 0)) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_126)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_142| 4294967295) 4294967296) (* 2 (mod v_~n~0_126 2147483648))) (= (select .cse1 (+ v_~f~0.offset_116 (* 4 .cse0))) v_~x1~0_166) (= |v_thread1Thread1of1ForFork0_~i~0#1_142| 3) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_126)) 1 0) 0)))))) InVars {~size~0=v_~size~0_126, ~f~0.base=v_~f~0.base_116, #memory_int=|v_#memory_int_191|, ~n~0=v_~n~0_126, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_116} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_90|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|, ~size~0=v_~size~0_126, ~f~0.base=v_~f~0.base_116, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_142|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88|, #memory_int=|v_#memory_int_191|, ~n~0=v_~n~0_126, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_98|, ~f~0.offset=v_~f~0.offset_116} AuxVars[] 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 11:14:17,606 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:14:17,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 690 [2022-12-13 11:14:17,606 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 360 transitions, 9038 flow [2022-12-13 11:14:17,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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 11:14:17,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:17,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:17,612 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 11:14:17,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 11:14:17,812 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 11:14:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 654859531, now seen corresponding path program 1 times [2022-12-13 11:14:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58109081] [2022-12-13 11:14:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,142 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 11:14:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58109081] [2022-12-13 11:14:18,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58109081] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729519864] [2022-12-13 11:14:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:14:18,148 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 11:14:18,150 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 11:14:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:14:18,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:18,550 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 11:14:18,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:18,927 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 11:14:18,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729519864] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:18,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:18,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 11:14:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185179832] [2022-12-13 11:14:18,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:14:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:14:18,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:14:18,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 87 [2022-12-13 11:14:18,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 360 transitions, 9038 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:18,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:18,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 87 [2022-12-13 11:14:18,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:21,080 INFO L130 PetriNetUnfolder]: 2087/4365 cut-off events. [2022-12-13 11:14:21,080 INFO L131 PetriNetUnfolder]: For 230827/230827 co-relation queries the response was YES. [2022-12-13 11:14:21,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51731 conditions, 4365 events. 2087/4365 cut-off events. For 230827/230827 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 35724 event pairs, 374 based on Foata normal form. 36/4397 useless extension candidates. Maximal degree in co-relation 50878. Up to 2649 conditions per place. [2022-12-13 11:14:21,132 INFO L137 encePairwiseOnDemand]: 35/87 looper letters, 277 selfloop transitions, 230 changer transitions 9/516 dead transitions. [2022-12-13 11:14:21,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 516 transitions, 13488 flow [2022-12-13 11:14:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:14:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 11:14:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 180 transitions. [2022-12-13 11:14:21,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15915119363395225 [2022-12-13 11:14:21,135 INFO L175 Difference]: Start difference. First operand has 244 places, 360 transitions, 9038 flow. Second operand 13 states and 180 transitions. [2022-12-13 11:14:21,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 516 transitions, 13488 flow [2022-12-13 11:14:21,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 516 transitions, 13275 flow, removed 73 selfloop flow, removed 5 redundant places. [2022-12-13 11:14:21,801 INFO L231 Difference]: Finished difference. Result has 260 places, 445 transitions, 12341 flow [2022-12-13 11:14:21,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=8863, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12341, PETRI_PLACES=260, PETRI_TRANSITIONS=445} [2022-12-13 11:14:21,801 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 239 predicate places. [2022-12-13 11:14:21,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:21,802 INFO L89 Accepts]: Start accepts. Operand has 260 places, 445 transitions, 12341 flow [2022-12-13 11:14:21,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:21,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:21,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 445 transitions, 12341 flow [2022-12-13 11:14:21,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 445 transitions, 12341 flow [2022-12-13 11:14:22,148 INFO L130 PetriNetUnfolder]: 492/1941 cut-off events. [2022-12-13 11:14:22,148 INFO L131 PetriNetUnfolder]: For 120235/120306 co-relation queries the response was YES. [2022-12-13 11:14:22,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23847 conditions, 1941 events. 492/1941 cut-off events. For 120235/120306 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 19806 event pairs, 52 based on Foata normal form. 1/1929 useless extension candidates. Maximal degree in co-relation 23450. Up to 793 conditions per place. [2022-12-13 11:14:22,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 445 transitions, 12341 flow [2022-12-13 11:14:22,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-13 11:14:22,247 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_360| v_~f~0.base_270))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_270 (* v_~x1~0_474 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_270 (* .cse3 4)))) (.cse8 (select .cse0 (+ v_~f~0.offset_270 (* v_~x2~0_453 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_270 (* .cse8 4)))) (.cse11 (select .cse0 (+ v_~f~0.offset_270 (* .cse6 4))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_270 (* .cse11 4)))) (.cse9 (select .cse0 (+ v_~f~0.offset_270 (* 4 .cse2))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_270 (* 4 .cse9)))) (.cse7 (select .cse0 (+ v_~f~0.offset_270 (* 4 .cse10))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_270 (* .cse7 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_270 (* .cse5 4))))) (and (= (select .cse0 (+ v_~f~0.offset_270 (* .cse1 4))) v_~x1~0_472) (not (= (ite (and (< .cse2 v_~size~0_278) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_278) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_253| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_269|) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_421|) (not (= 0 (ite (and (< v_~x2~0_453 v_~size~0_278) (<= 0 v_~x2~0_453)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_259| (ite (and (< .cse4 v_~size~0_278) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_278) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_253| (ite (and (< .cse1 v_~size~0_278) (<= 0 .cse1)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_421| 4294967295) 4294967296) (* 2 (mod v_~n~0_278 2147483648))) (not (= (ite (and (< .cse6 v_~size~0_278) (<= 0 .cse6)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_270 (* .cse4 4))) v_~x2~0_451) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_269| 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_375|) (not (= 0 (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_278)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283| 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_278)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_278) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_278)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_278)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_259| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|) (not (= (ite (and (<= 0 v_~x1~0_474) (< v_~x1~0_474 v_~size~0_278)) 1 0) 0)))))))))) InVars {~x2~0=v_~x2~0_453, ~size~0=v_~size~0_278, ~f~0.base=v_~f~0.base_270, #memory_int=|v_#memory_int_360|, ~n~0=v_~n~0_278, ~x1~0=v_~x1~0_474, ~f~0.offset=v_~f~0.offset_270} OutVars{~x2~0=v_~x2~0_451, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_271|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_245|, ~size~0=v_~size~0_278, ~f~0.base=v_~f~0.base_270, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_249|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_259|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_375|, ~x1~0=v_~x1~0_472, ~f~0.offset=v_~f~0.offset_270, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_253|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_421|, #memory_int=|v_#memory_int_360|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_269|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_235|, ~n~0=v_~n~0_278, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_235|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_279|} 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 11:14:23,039 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 11:14:23,135 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 11:14:23,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [800] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_451| v_~f~0.base_350))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_350 (* v_~x1~0_679 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_350 (* .cse12 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_350 (* v_~x2~0_636 4)))) (.cse8 (select .cse3 (+ v_~f~0.offset_350 (* .cse6 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_350 (* .cse8 4)))) (.cse1 (select .cse3 (+ v_~f~0.offset_350 (* .cse7 4))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_350 (* .cse1 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_350 (* .cse10 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_350 (* .cse0 4)))) (.cse11 (select .cse3 (+ v_~f~0.offset_350 (* .cse9 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_350 (* .cse11 4)))) (.cse5 (select .cse3 (+ v_~f~0.offset_350 (* .cse2 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_358) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_358) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_358)) 1 0))) (= v_~x2~0_635 (select .cse3 (+ v_~f~0.offset_350 (* .cse4 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_396| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_396|) (< 6 (* (mod v_~n~0_358 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_~i~0#1_564| 8) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_381| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_358)) 1 0)) (not (= (ite (and (<= 0 v_~x1~0_679) (< v_~x1~0_679 v_~size~0_358)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_358) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_636) (< v_~x2~0_636 v_~size~0_358)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_358) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_381| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_397|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| (ite (and (< .cse4 v_~size~0_358) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse8 v_~size~0_358) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_358)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_358)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_358) (<= 0 .cse11)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_495|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_397| 0)) (= v_~x1~0_677 (select .cse3 (+ v_~f~0.offset_350 (* .cse5 4)))) (not (= (ite (and (< .cse12 v_~size~0_358) (<= 0 .cse12)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_636, ~size~0=v_~size~0_358, ~f~0.base=v_~f~0.base_350, #memory_int=|v_#memory_int_451|, ~n~0=v_~n~0_358, ~x1~0=v_~x1~0_679, ~f~0.offset=v_~f~0.offset_350} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_399|, ~x2~0=v_~x2~0_635, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_358|, ~size~0=v_~size~0_358, ~f~0.base=v_~f~0.base_350, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_362|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_495|, ~x1~0=v_~x1~0_677, ~f~0.offset=v_~f~0.offset_350, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_396|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_381|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_564|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_397|, #memory_int=|v_#memory_int_451|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_348|, ~n~0=v_~n~0_358, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_407|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_348|} 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 11:14:25,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_354| v_~f~0.base_264))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_264 (* v_~x2~0_435 4)))) (.cse1 (select .cse8 (+ v_~f~0.offset_264 (* v_~x1~0_456 4))))) (and (not (= 0 (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_272)) 1 0))) (not (= (ite (and (< .cse1 v_~size~0_272) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_456) (< v_~x1~0_456 v_~size~0_272)) 1 0))) (let ((.cse19 (select .cse8 (+ v_~f~0.offset_264 (* .cse1 4)))) (.cse26 (select .cse8 (+ v_~f~0.offset_264 (* .cse0 4))))) (let ((.cse22 (select .cse8 (+ v_~f~0.offset_264 (* .cse26 4)))) (.cse20 (select .cse8 (+ v_~f~0.offset_264 (* .cse19 4))))) (let ((.cse24 (select .cse8 (+ v_~f~0.offset_264 (* .cse20 4)))) (.cse25 (select .cse8 (+ v_~f~0.offset_264 (* .cse22 4))))) (let ((.cse21 (select .cse8 (+ v_~f~0.offset_264 (* .cse25 4)))) (.cse23 (select .cse8 (+ v_~f~0.offset_264 (* .cse24 4))))) (let ((.cse2 (not (= (ite (and (<= 0 .cse26) (< .cse26 v_~size~0_272)) 1 0) 0))) (.cse9 (select .cse8 (+ (* .cse23 4) v_~f~0.offset_264))) (.cse3 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|)) (.cse4 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| 0))) (.cse5 (= (select .cse8 (+ v_~f~0.offset_264 (* 4 .cse21))) v_~x2~0_433)) (.cse6 (not (= (ite (and (< .cse25 v_~size~0_272) (<= 0 .cse25)) 1 0) 0))) (.cse7 (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_272)) 1 0) 0))) (.cse13 (ite (and (< .cse23 v_~size~0_272) (<= 0 .cse23)) 1 0)) (.cse10 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271| 0))) (.cse11 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|)) (.cse12 (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_272)) 1 0) 0))) (.cse14 (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_363|)) (.cse15 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247| (ite (and (< .cse21 v_~size~0_272) (<= 0 .cse21)) 1 0))) (.cse16 (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_409| 4294967295) 4294967296) (* 2 (mod v_~n~0_272 2147483648)))) (.cse17 (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_272)) 1 0) 0))) (.cse18 (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_272)) 1 0) 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_~x1~0_454 (select .cse8 (+ v_~f~0.offset_264 (* 4 .cse9)))) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_409|) .cse10 .cse11 .cse12 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241| (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_272)) 1 0)) (not (= 0 .cse13)) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse2 (= v_~x1~0_454 .cse9) .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_thread1Thread1of1ForFork0_~i~0#1_409| 6) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241| .cse13) .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18))))))) (not (= (ite (and (< v_~x2~0_435 v_~size~0_272) (<= 0 v_~x2~0_435)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_435, ~size~0=v_~size~0_272, ~f~0.base=v_~f~0.base_264, #memory_int=|v_#memory_int_354|, ~n~0=v_~n~0_272, ~x1~0=v_~x1~0_456, ~f~0.offset=v_~f~0.offset_264} OutVars{~x2~0=v_~x2~0_433, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_259|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_233|, ~size~0=v_~size~0_272, ~f~0.base=v_~f~0.base_264, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_237|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_363|, ~x1~0=v_~x1~0_454, ~f~0.offset=v_~f~0.offset_264, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_409|, #memory_int=|v_#memory_int_354|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_223|, ~n~0=v_~n~0_272, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_223|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_267|} 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 [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] [2022-12-13 11:14:27,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_354| v_~f~0.base_264))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_264 (* v_~x2~0_435 4)))) (.cse1 (select .cse8 (+ v_~f~0.offset_264 (* v_~x1~0_456 4))))) (and (not (= 0 (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_272)) 1 0))) (not (= (ite (and (< .cse1 v_~size~0_272) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_456) (< v_~x1~0_456 v_~size~0_272)) 1 0))) (let ((.cse19 (select .cse8 (+ v_~f~0.offset_264 (* .cse1 4)))) (.cse26 (select .cse8 (+ v_~f~0.offset_264 (* .cse0 4))))) (let ((.cse22 (select .cse8 (+ v_~f~0.offset_264 (* .cse26 4)))) (.cse20 (select .cse8 (+ v_~f~0.offset_264 (* .cse19 4))))) (let ((.cse24 (select .cse8 (+ v_~f~0.offset_264 (* .cse20 4)))) (.cse25 (select .cse8 (+ v_~f~0.offset_264 (* .cse22 4))))) (let ((.cse21 (select .cse8 (+ v_~f~0.offset_264 (* .cse25 4)))) (.cse23 (select .cse8 (+ v_~f~0.offset_264 (* .cse24 4))))) (let ((.cse2 (not (= (ite (and (<= 0 .cse26) (< .cse26 v_~size~0_272)) 1 0) 0))) (.cse9 (select .cse8 (+ (* .cse23 4) v_~f~0.offset_264))) (.cse3 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|)) (.cse4 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| 0))) (.cse5 (= (select .cse8 (+ v_~f~0.offset_264 (* 4 .cse21))) v_~x2~0_433)) (.cse6 (not (= (ite (and (< .cse25 v_~size~0_272) (<= 0 .cse25)) 1 0) 0))) (.cse7 (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_272)) 1 0) 0))) (.cse13 (ite (and (< .cse23 v_~size~0_272) (<= 0 .cse23)) 1 0)) (.cse10 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271| 0))) (.cse11 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|)) (.cse12 (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_272)) 1 0) 0))) (.cse14 (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_363|)) (.cse15 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247| (ite (and (< .cse21 v_~size~0_272) (<= 0 .cse21)) 1 0))) (.cse16 (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_409| 4294967295) 4294967296) (* 2 (mod v_~n~0_272 2147483648)))) (.cse17 (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_272)) 1 0) 0))) (.cse18 (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_272)) 1 0) 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_~x1~0_454 (select .cse8 (+ v_~f~0.offset_264 (* 4 .cse9)))) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_409|) .cse10 .cse11 .cse12 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241| (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_272)) 1 0)) (not (= 0 .cse13)) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse2 (= v_~x1~0_454 .cse9) .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_thread1Thread1of1ForFork0_~i~0#1_409| 6) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241| .cse13) .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18))))))) (not (= (ite (and (< v_~x2~0_435 v_~size~0_272) (<= 0 v_~x2~0_435)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_435, ~size~0=v_~size~0_272, ~f~0.base=v_~f~0.base_264, #memory_int=|v_#memory_int_354|, ~n~0=v_~n~0_272, ~x1~0=v_~x1~0_456, ~f~0.offset=v_~f~0.offset_264} OutVars{~x2~0=v_~x2~0_433, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_259|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_233|, ~size~0=v_~size~0_272, ~f~0.base=v_~f~0.base_264, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_237|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_363|, ~x1~0=v_~x1~0_454, ~f~0.offset=v_~f~0.offset_264, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_409|, #memory_int=|v_#memory_int_354|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_223|, ~n~0=v_~n~0_272, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_223|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_267|} 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 11:14:29,039 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:14:29,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7239 [2022-12-13 11:14:29,040 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 444 transitions, 12534 flow [2022-12-13 11:14:29,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:29,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:29,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:29,046 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 11:14:29,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:29,241 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 11:14:29,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2122161326, now seen corresponding path program 1 times [2022-12-13 11:14:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:29,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563704884] [2022-12-13 11:14:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:31,376 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 11:14:31,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563704884] [2022-12-13 11:14:31,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563704884] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:31,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155046753] [2022-12-13 11:14:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:31,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:14:31,380 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 11:14:31,383 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 11:14:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:31,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 11:14:31,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:31,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:31,518 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 11:14:31,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:31,587 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 11:14:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:31,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:31,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:31,842 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 11:14:31,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:31,912 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 11:14:35,096 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 11:14:35,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155046753] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:35,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:35,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 11:14:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193005038] [2022-12-13 11:14:35,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:35,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:14:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:35,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:14:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:14:35,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 94 [2022-12-13 11:14:35,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 444 transitions, 12534 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 11:14:35,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:35,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 94 [2022-12-13 11:14:35,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:39,747 INFO L130 PetriNetUnfolder]: 2128/4447 cut-off events. [2022-12-13 11:14:39,747 INFO L131 PetriNetUnfolder]: For 307640/307640 co-relation queries the response was YES. [2022-12-13 11:14:39,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58465 conditions, 4447 events. 2128/4447 cut-off events. For 307640/307640 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 36338 event pairs, 869 based on Foata normal form. 3/4446 useless extension candidates. Maximal degree in co-relation 57562. Up to 3951 conditions per place. [2022-12-13 11:14:39,809 INFO L137 encePairwiseOnDemand]: 35/94 looper letters, 357 selfloop transitions, 133 changer transitions 6/496 dead transitions. [2022-12-13 11:14:39,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 496 transitions, 14663 flow [2022-12-13 11:14:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:14:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 11:14:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2022-12-13 11:14:39,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1450676982591876 [2022-12-13 11:14:39,811 INFO L175 Difference]: Start difference. First operand has 259 places, 444 transitions, 12534 flow. Second operand 11 states and 150 transitions. [2022-12-13 11:14:39,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 496 transitions, 14663 flow [2022-12-13 11:14:40,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 496 transitions, 13871 flow, removed 392 selfloop flow, removed 1 redundant places. [2022-12-13 11:14:40,741 INFO L231 Difference]: Finished difference. Result has 272 places, 457 transitions, 12660 flow [2022-12-13 11:14:40,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=11751, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12660, PETRI_PLACES=272, PETRI_TRANSITIONS=457} [2022-12-13 11:14:40,742 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 251 predicate places. [2022-12-13 11:14:40,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:40,742 INFO L89 Accepts]: Start accepts. Operand has 272 places, 457 transitions, 12660 flow [2022-12-13 11:14:40,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:40,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:40,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 457 transitions, 12660 flow [2022-12-13 11:14:40,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 457 transitions, 12660 flow [2022-12-13 11:14:41,163 INFO L130 PetriNetUnfolder]: 505/1996 cut-off events. [2022-12-13 11:14:41,163 INFO L131 PetriNetUnfolder]: For 126331/126390 co-relation queries the response was YES. [2022-12-13 11:14:41,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24419 conditions, 1996 events. 505/1996 cut-off events. For 126331/126390 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 20558 event pairs, 58 based on Foata normal form. 1/1988 useless extension candidates. Maximal degree in co-relation 24009. Up to 781 conditions per place. [2022-12-13 11:14:41,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 271 places, 457 transitions, 12660 flow [2022-12-13 11:14:41,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 11:14:41,199 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:14:41,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 458 [2022-12-13 11:14:41,200 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 457 transitions, 12660 flow [2022-12-13 11:14:41,200 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 11:14:41,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:41,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:41,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 11:14:41,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:41,401 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 11:14:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:41,401 INFO L85 PathProgramCache]: Analyzing trace with hash 73184919, now seen corresponding path program 1 times [2022-12-13 11:14:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:41,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142328260] [2022-12-13 11:14:41,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:43,874 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 11:14:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:43,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142328260] [2022-12-13 11:14:43,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142328260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:43,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:43,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:14:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979027248] [2022-12-13 11:14:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:43,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:14:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:14:43,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:14:43,875 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 93 [2022-12-13 11:14:43,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 457 transitions, 12660 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 11:14:43,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:43,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 93 [2022-12-13 11:14:43,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:46,390 INFO L130 PetriNetUnfolder]: 2135/4463 cut-off events. [2022-12-13 11:14:46,390 INFO L131 PetriNetUnfolder]: For 309584/309584 co-relation queries the response was YES. [2022-12-13 11:14:46,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57816 conditions, 4463 events. 2135/4463 cut-off events. For 309584/309584 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 36507 event pairs, 871 based on Foata normal form. 1/4460 useless extension candidates. Maximal degree in co-relation 56895. Up to 4145 conditions per place. [2022-12-13 11:14:46,454 INFO L137 encePairwiseOnDemand]: 30/93 looper letters, 340 selfloop transitions, 143 changer transitions 10/493 dead transitions. [2022-12-13 11:14:46,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 493 transitions, 14280 flow [2022-12-13 11:14:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:14:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:14:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-13 11:14:46,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1774193548387097 [2022-12-13 11:14:46,455 INFO L175 Difference]: Start difference. First operand has 271 places, 457 transitions, 12660 flow. Second operand 8 states and 132 transitions. [2022-12-13 11:14:46,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 493 transitions, 14280 flow [2022-12-13 11:14:47,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 493 transitions, 14061 flow, removed 79 selfloop flow, removed 6 redundant places. [2022-12-13 11:14:47,586 INFO L231 Difference]: Finished difference. Result has 276 places, 466 transitions, 13139 flow [2022-12-13 11:14:47,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=12465, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13139, PETRI_PLACES=276, PETRI_TRANSITIONS=466} [2022-12-13 11:14:47,587 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 255 predicate places. [2022-12-13 11:14:47,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:47,587 INFO L89 Accepts]: Start accepts. Operand has 276 places, 466 transitions, 13139 flow [2022-12-13 11:14:47,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:47,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:47,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 466 transitions, 13139 flow [2022-12-13 11:14:47,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 466 transitions, 13139 flow [2022-12-13 11:14:47,963 INFO L130 PetriNetUnfolder]: 508/2002 cut-off events. [2022-12-13 11:14:47,963 INFO L131 PetriNetUnfolder]: For 125843/125902 co-relation queries the response was YES. [2022-12-13 11:14:48,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24379 conditions, 2002 events. 508/2002 cut-off events. For 125843/125902 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 20588 event pairs, 56 based on Foata normal form. 1/1991 useless extension candidates. Maximal degree in co-relation 23965. Up to 786 conditions per place. [2022-12-13 11:14:48,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 466 transitions, 13139 flow [2022-12-13 11:14:48,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 1168 [2022-12-13 11:14:48,452 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [783] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_425| v_~f~0.base_328))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_328 (* v_~x2~0_594 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_328 (* .cse0 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_328 (* 4 .cse3))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_328 (* .cse5 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_328 (* .cse4 4))))) (and (not (= 0 (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_336)) 1 0))) (not (= (ite (and (<= 0 v_~x2~0_594) (< v_~x2~0_594 v_~size~0_336)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_328 (* .cse2 4))) v_~x2~0_592) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_468|) (not (= (ite (and (< .cse3 v_~size~0_336) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_336)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_348| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_348| (ite (and (< .cse2 v_~size~0_336) (<= 0 .cse2)) 1 0)) (not (= 0 (ite (and (< .cse5 v_~size~0_336) (<= 0 .cse5)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372| 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_468|) 4294967296) (* 2 (mod v_~n~0_336 2147483648)))))))))) InVars {~x2~0=v_~x2~0_594, ~size~0=v_~size~0_336, ~f~0.base=v_~f~0.base_328, #memory_int=|v_#memory_int_425|, ~n~0=v_~n~0_336, ~f~0.offset=v_~f~0.offset_328} OutVars{~x2~0=v_~x2~0_592, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_334|, ~size~0=v_~size~0_336, ~f~0.base=v_~f~0.base_328, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_338|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_348|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_468|, ~f~0.offset=v_~f~0.offset_328, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|, #memory_int=|v_#memory_int_425|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_324|, ~n~0=v_~n~0_336, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_324|} 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 [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:14:48,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:14:48,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1298 [2022-12-13 11:14:48,885 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 466 transitions, 13165 flow [2022-12-13 11:14:48,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 11:14:48,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:48,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:48,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 11:14:48,885 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 11:14:48,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1017304070, now seen corresponding path program 1 times [2022-12-13 11:14:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:48,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036787452] [2022-12-13 11:14:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:48,936 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 11:14:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:48,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036787452] [2022-12-13 11:14:48,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036787452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:48,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:48,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:14:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634026319] [2022-12-13 11:14:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:48,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:14:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:14:48,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:14:48,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 95 [2022-12-13 11:14:48,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 466 transitions, 13165 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:48,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:48,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 95 [2022-12-13 11:14:48,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:50,439 INFO L130 PetriNetUnfolder]: 2119/4427 cut-off events. [2022-12-13 11:14:50,439 INFO L131 PetriNetUnfolder]: For 285220/285220 co-relation queries the response was YES. [2022-12-13 11:14:50,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56938 conditions, 4427 events. 2119/4427 cut-off events. For 285220/285220 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 35978 event pairs, 370 based on Foata normal form. 4/4427 useless extension candidates. Maximal degree in co-relation 56011. Up to 2349 conditions per place. [2022-12-13 11:14:50,497 INFO L137 encePairwiseOnDemand]: 89/95 looper letters, 513 selfloop transitions, 12 changer transitions 5/530 dead transitions. [2022-12-13 11:14:50,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 530 transitions, 15938 flow [2022-12-13 11:14:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:14:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:14:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-12-13 11:14:50,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37894736842105264 [2022-12-13 11:14:50,498 INFO L175 Difference]: Start difference. First operand has 276 places, 466 transitions, 13165 flow. Second operand 3 states and 108 transitions. [2022-12-13 11:14:50,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 530 transitions, 15938 flow [2022-12-13 11:14:51,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 530 transitions, 15610 flow, removed 92 selfloop flow, removed 2 redundant places. [2022-12-13 11:14:51,655 INFO L231 Difference]: Finished difference. Result has 276 places, 463 transitions, 12823 flow [2022-12-13 11:14:51,656 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=12843, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=12823, PETRI_PLACES=276, PETRI_TRANSITIONS=463} [2022-12-13 11:14:51,656 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 255 predicate places. [2022-12-13 11:14:51,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:51,656 INFO L89 Accepts]: Start accepts. Operand has 276 places, 463 transitions, 12823 flow [2022-12-13 11:14:51,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:51,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:51,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 463 transitions, 12823 flow [2022-12-13 11:14:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 463 transitions, 12823 flow [2022-12-13 11:14:52,139 INFO L130 PetriNetUnfolder]: 506/1913 cut-off events. [2022-12-13 11:14:52,139 INFO L131 PetriNetUnfolder]: For 126638/126705 co-relation queries the response was YES. [2022-12-13 11:14:52,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24200 conditions, 1913 events. 506/1913 cut-off events. For 126638/126705 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19216 event pairs, 57 based on Foata normal form. 1/1901 useless extension candidates. Maximal degree in co-relation 23794. Up to 781 conditions per place. [2022-12-13 11:14:52,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 463 transitions, 12823 flow [2022-12-13 11:14:52,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 1146 [2022-12-13 11:14:52,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse5 (select |v_#memory_int_463| v_~f~0.base_362))) (let ((.cse7 (select .cse5 (+ v_~f~0.offset_362 (* v_~x1~0_704 4)))) (.cse6 (select .cse5 (+ v_~f~0.offset_362 (* v_~x2~0_656 4))))) (let ((.cse9 (select .cse5 (+ v_~f~0.offset_362 (* .cse6 4)))) (.cse2 (select .cse5 (+ v_~f~0.offset_362 (* .cse7 4))))) (let ((.cse11 (select .cse5 (+ v_~f~0.offset_362 (* .cse2 4)))) (.cse4 (select .cse5 (+ v_~f~0.offset_362 (* .cse9 4))))) (let ((.cse10 (select .cse5 (+ v_~f~0.offset_362 (* .cse4 4)))) (.cse8 (select .cse5 (+ v_~f~0.offset_362 (* .cse11 4))))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_362 (* .cse8 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_362 (* .cse10 4)))) (.cse3 (* 2 (mod v_~n~0_370 2147483648)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_384| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_370)) 1 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_511|) (= (ite (and (< .cse1 v_~size~0_370) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_395|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_370)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_582| 4294967295) 4294967296) .cse3) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_370)) 1 0) 0)) (= v_~x1~0_703 (select .cse5 (+ v_~f~0.offset_362 (* .cse1 4)))) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_370)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_384| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|) (not (= (ite (and (< .cse7 v_~size~0_370) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_370) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_370)) 1 0) 0)) (= v_~x2~0_655 (select .cse5 (+ v_~f~0.offset_362 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x1~0_704) (< v_~x1~0_704 v_~size~0_370)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_411| 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_46|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_511| 4294967296) .cse3)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_46| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_582| 6) (not (= (ite (and (< .cse10 v_~size~0_370) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_656) (< v_~x2~0_656 v_~size~0_370)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_370) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_395| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_411|)))))))) InVars {~x2~0=v_~x2~0_656, ~size~0=v_~size~0_370, ~f~0.base=v_~f~0.base_362, #memory_int=|v_#memory_int_463|, ~n~0=v_~n~0_370, ~x1~0=v_~x1~0_704, ~f~0.offset=v_~f~0.offset_362} OutVars{~x2~0=v_~x2~0_655, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_413|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_370|, ~size~0=v_~size~0_370, ~f~0.base=v_~f~0.base_362, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_46|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_374|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_384|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_511|, ~x1~0=v_~x1~0_703, ~f~0.offset=v_~f~0.offset_362, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_395|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_46|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_582|, #memory_int=|v_#memory_int_463|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_411|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_360|, ~n~0=v_~n~0_370, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_360|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_421|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, 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 11:14:53,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_409| v_~f~0.base_314))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_314 (* v_~x1~0_588 4)))) (.cse2 (select .cse0 (+ (* v_~x2~0_564 4) v_~f~0.offset_314)))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_314 (* 4 .cse2)))) (.cse3 (select .cse0 (+ v_~f~0.offset_314 (* .cse6 4))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_314 (* .cse3 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_314 (* .cse4 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_314 (* .cse7 4)))) (.cse9 (select .cse0 (+ v_~f~0.offset_314 (* .cse10 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_314 (* .cse9 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_314 (* 4 .cse8))))) (and (not (= (ite (and (< v_~x1~0_588 v_~size~0_322) (<= 0 v_~x1~0_588)) 1 0) 0)) (= v_~x1~0_587 (select .cse0 (+ v_~f~0.offset_314 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_354| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_354|) (= |v_thread1Thread1of1ForFork0_~i~0#1_504| 6) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_322)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_322) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_322) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_322)) 1 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_322)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_564) (< v_~x2~0_564 v_~size~0_322)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_322)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_327|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_327| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_343|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_450|) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_322)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_322)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_322)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_343| 0)) (not (= (ite (and (< .cse10 v_~size~0_322) (<= 0 .cse10)) 1 0) 0)) (= v_~x2~0_562 (select .cse0 (+ v_~f~0.offset_314 (* .cse5 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_504| 4294967294) 4294967296) (* 2 (mod v_~n~0_322 2147483648)))))))))) InVars {~x2~0=v_~x2~0_564, ~size~0=v_~size~0_322, ~f~0.base=v_~f~0.base_314, #memory_int=|v_#memory_int_409|, ~n~0=v_~n~0_322, ~x1~0=v_~x1~0_588, ~f~0.offset=v_~f~0.offset_314} OutVars{~x2~0=v_~x2~0_562, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_345|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_316|, ~size~0=v_~size~0_322, ~f~0.base=v_~f~0.base_314, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_320|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_450|, ~x1~0=v_~x1~0_587, ~f~0.offset=v_~f~0.offset_314, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_354|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_327|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_504|, #memory_int=|v_#memory_int_409|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_343|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_306|, ~n~0=v_~n~0_322, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_306|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_353|} 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 11:14:53,978 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:14:53,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2323 [2022-12-13 11:14:53,979 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 462 transitions, 12861 flow [2022-12-13 11:14:53,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:53,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:53,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:53,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 11:14:53,979 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 11:14:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash -727765331, now seen corresponding path program 1 times [2022-12-13 11:14:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:53,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845349059] [2022-12-13 11:14:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:53,990 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 11:14:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:53,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845349059] [2022-12-13 11:14:53,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845349059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:53,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:53,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:14:53,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200635540] [2022-12-13 11:14:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:53,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:14:53,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:53,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:14:53,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:14:53,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 96 [2022-12-13 11:14:53,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 462 transitions, 12861 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 11:14:53,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:53,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 96 [2022-12-13 11:14:53,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:55,399 INFO L130 PetriNetUnfolder]: 2105/4384 cut-off events. [2022-12-13 11:14:55,399 INFO L131 PetriNetUnfolder]: For 285967/285967 co-relation queries the response was YES. [2022-12-13 11:14:55,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56626 conditions, 4384 events. 2105/4384 cut-off events. For 285967/285967 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 35373 event pairs, 1028 based on Foata normal form. 2/4382 useless extension candidates. Maximal degree in co-relation 55727. Up to 4385 conditions per place. [2022-12-13 11:14:55,456 INFO L137 encePairwiseOnDemand]: 95/96 looper letters, 460 selfloop transitions, 0 changer transitions 0/460 dead transitions. [2022-12-13 11:14:55,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 460 transitions, 13701 flow [2022-12-13 11:14:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:14:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:14:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2022-12-13 11:14:55,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 11:14:55,457 INFO L175 Difference]: Start difference. First operand has 274 places, 462 transitions, 12861 flow. Second operand 2 states and 96 transitions. [2022-12-13 11:14:55,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 460 transitions, 13701 flow [2022-12-13 11:14:56,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 460 transitions, 13632 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-13 11:14:56,472 INFO L231 Difference]: Finished difference. Result has 273 places, 460 transitions, 12712 flow [2022-12-13 11:14:56,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=12712, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=12712, PETRI_PLACES=273, PETRI_TRANSITIONS=460} [2022-12-13 11:14:56,473 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 252 predicate places. [2022-12-13 11:14:56,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:56,474 INFO L89 Accepts]: Start accepts. Operand has 273 places, 460 transitions, 12712 flow [2022-12-13 11:14:56,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:56,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:56,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 460 transitions, 12712 flow [2022-12-13 11:14:56,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 460 transitions, 12712 flow [2022-12-13 11:14:57,034 INFO L130 PetriNetUnfolder]: 505/1972 cut-off events. [2022-12-13 11:14:57,034 INFO L131 PetriNetUnfolder]: For 117924/117990 co-relation queries the response was YES. [2022-12-13 11:14:57,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23902 conditions, 1972 events. 505/1972 cut-off events. For 117924/117990 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 20150 event pairs, 56 based on Foata normal form. 0/1960 useless extension candidates. Maximal degree in co-relation 23501. Up to 777 conditions per place. [2022-12-13 11:14:57,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 460 transitions, 12712 flow [2022-12-13 11:14:57,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-13 11:14:57,070 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:14:57,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 598 [2022-12-13 11:14:57,071 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 460 transitions, 12712 flow [2022-12-13 11:14:57,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 11:14:57,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:57,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:57,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 11:14:57,071 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 11:14:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1344801479, now seen corresponding path program 1 times [2022-12-13 11:14:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:57,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278445599] [2022-12-13 11:14:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:57,211 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 11:14:57,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:57,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278445599] [2022-12-13 11:14:57,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278445599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:57,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:57,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:14:57,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468248158] [2022-12-13 11:14:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:57,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:14:57,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:14:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:14:57,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 95 [2022-12-13 11:14:57,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 460 transitions, 12712 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 11:14:57,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:57,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 95 [2022-12-13 11:14:57,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:58,830 INFO L130 PetriNetUnfolder]: 2132/4419 cut-off events. [2022-12-13 11:14:58,830 INFO L131 PetriNetUnfolder]: For 273574/273574 co-relation queries the response was YES. [2022-12-13 11:14:58,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56837 conditions, 4419 events. 2132/4419 cut-off events. For 273574/273574 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 35599 event pairs, 918 based on Foata normal form. 12/4427 useless extension candidates. Maximal degree in co-relation 55946. Up to 3950 conditions per place. [2022-12-13 11:14:58,890 INFO L137 encePairwiseOnDemand]: 52/95 looper letters, 361 selfloop transitions, 122 changer transitions 1/484 dead transitions. [2022-12-13 11:14:58,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 484 transitions, 14437 flow [2022-12-13 11:14:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:14:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:14:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-13 11:14:58,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2789473684210526 [2022-12-13 11:14:58,891 INFO L175 Difference]: Start difference. First operand has 272 places, 460 transitions, 12712 flow. Second operand 4 states and 106 transitions. [2022-12-13 11:14:58,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 484 transitions, 14437 flow [2022-12-13 11:14:59,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 484 transitions, 14429 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 11:14:59,822 INFO L231 Difference]: Finished difference. Result has 276 places, 470 transitions, 13440 flow [2022-12-13 11:14:59,823 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=12704, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13440, PETRI_PLACES=276, PETRI_TRANSITIONS=470} [2022-12-13 11:14:59,823 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 255 predicate places. [2022-12-13 11:14:59,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:59,823 INFO L89 Accepts]: Start accepts. Operand has 276 places, 470 transitions, 13440 flow [2022-12-13 11:14:59,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:59,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:59,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 470 transitions, 13440 flow [2022-12-13 11:14:59,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 470 transitions, 13440 flow [2022-12-13 11:15:00,189 INFO L130 PetriNetUnfolder]: 516/1980 cut-off events. [2022-12-13 11:15:00,190 INFO L131 PetriNetUnfolder]: For 124683/124750 co-relation queries the response was YES. [2022-12-13 11:15:00,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24754 conditions, 1980 events. 516/1980 cut-off events. For 124683/124750 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 20112 event pairs, 57 based on Foata normal form. 0/1968 useless extension candidates. Maximal degree in co-relation 24345. Up to 801 conditions per place. [2022-12-13 11:15:00,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 470 transitions, 13440 flow [2022-12-13 11:15:00,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 11:15:01,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [814] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_475| v_~f~0.base_372))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_372 (* v_~x2~0_682 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_372 (* .cse4 4))))) (let ((.cse12 (select .cse0 (+ v_~f~0.offset_372 (* v_~x1~0_728 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_372 (* .cse6 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_372 (* .cse7 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_372 (* .cse12 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_372 (* .cse5 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_372 (* .cse3 4))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_372 (* .cse2 4)))) (.cse8 (select .cse0 (+ v_~f~0.offset_372 (* .cse11 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_372 (* 4 .cse8)))) (.cse1 (select .cse0 (+ v_~f~0.offset_372 (* 4 .cse10))))) (and (= v_~x2~0_680 (select .cse0 (+ v_~f~0.offset_372 (* 4 .cse1)))) (not (= (ite (and (< v_~x1~0_728 v_~size~0_380) (<= 0 v_~x1~0_728)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_423|) (not (= (ite (and (< .cse2 v_~size~0_380) (<= 0 .cse2)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_525|) 4294967296) (* 2 (mod v_~n~0_380 2147483648))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_380)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_380) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_380)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_380) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_380) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_597| 6) (not (= (ite (and (< .cse8 v_~size~0_380) (<= 0 .cse8)) 1 0) 0)) (= v_~x1~0_727 (select .cse0 (+ (* .cse9 4) v_~f~0.offset_372))) (not (= (ite (and (<= 0 v_~x2~0_682) (< v_~x2~0_682 v_~size~0_380)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_525| 8) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_423| 0)) (= (ite (and (< .cse9 v_~size~0_380) (<= 0 .cse9)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410|) (not (= (ite (and (< .cse10 v_~size~0_380) (<= 0 .cse10)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_380)) 1 0)) (not (= (ite (and (< .cse11 v_~size~0_380) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_380) (<= 0 .cse12)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_682, ~size~0=v_~size~0_380, ~f~0.base=v_~f~0.base_372, #memory_int=|v_#memory_int_475|, ~n~0=v_~n~0_380, ~x1~0=v_~x1~0_728, ~f~0.offset=v_~f~0.offset_372} OutVars{~x2~0=v_~x2~0_680, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_428|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_384|, ~size~0=v_~size~0_380, ~f~0.base=v_~f~0.base_372, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_388|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_525|, ~x1~0=v_~x1~0_727, ~f~0.offset=v_~f~0.offset_372, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_423|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_597|, #memory_int=|v_#memory_int_475|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_374|, ~n~0=v_~n~0_380, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_374|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_436|} 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 11:15:03,687 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:15:03,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3865 [2022-12-13 11:15:03,688 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 470 transitions, 13533 flow [2022-12-13 11:15:03,688 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 11:15:03,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:15:03,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:15:03,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 11:15:03,688 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 11:15:03,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:15:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1563646293, now seen corresponding path program 1 times [2022-12-13 11:15:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:15:03,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019784635] [2022-12-13 11:15:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:15:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:03,755 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 11:15:03,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:15:03,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019784635] [2022-12-13 11:15:03,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019784635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:15:03,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:15:03,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:15:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982167933] [2022-12-13 11:15:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:15:03,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:15:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:15:03,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:15:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:15:03,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 97 [2022-12-13 11:15:03,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 470 transitions, 13533 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 11:15:03,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:15:03,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 97 [2022-12-13 11:15:03,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:15:05,442 INFO L130 PetriNetUnfolder]: 2178/4568 cut-off events. [2022-12-13 11:15:05,442 INFO L131 PetriNetUnfolder]: For 295101/295101 co-relation queries the response was YES. [2022-12-13 11:15:05,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59925 conditions, 4568 events. 2178/4568 cut-off events. For 295101/295101 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 37413 event pairs, 855 based on Foata normal form. 12/4574 useless extension candidates. Maximal degree in co-relation 59020. Up to 3622 conditions per place. [2022-12-13 11:15:05,505 INFO L137 encePairwiseOnDemand]: 64/97 looper letters, 446 selfloop transitions, 83 changer transitions 3/532 dead transitions. [2022-12-13 11:15:05,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 532 transitions, 16388 flow [2022-12-13 11:15:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:15:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:15:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-13 11:15:05,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29381443298969073 [2022-12-13 11:15:05,507 INFO L175 Difference]: Start difference. First operand has 276 places, 470 transitions, 13533 flow. Second operand 4 states and 114 transitions. [2022-12-13 11:15:05,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 532 transitions, 16388 flow [2022-12-13 11:15:06,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 532 transitions, 16127 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 11:15:06,564 INFO L231 Difference]: Finished difference. Result has 278 places, 487 transitions, 14113 flow [2022-12-13 11:15:06,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=13309, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=14113, PETRI_PLACES=278, PETRI_TRANSITIONS=487} [2022-12-13 11:15:06,565 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 257 predicate places. [2022-12-13 11:15:06,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:15:06,565 INFO L89 Accepts]: Start accepts. Operand has 278 places, 487 transitions, 14113 flow [2022-12-13 11:15:06,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:15:06,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:15:06,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 487 transitions, 14113 flow [2022-12-13 11:15:06,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 487 transitions, 14113 flow [2022-12-13 11:15:06,951 INFO L130 PetriNetUnfolder]: 523/2060 cut-off events. [2022-12-13 11:15:06,951 INFO L131 PetriNetUnfolder]: For 132114/132194 co-relation queries the response was YES. [2022-12-13 11:15:06,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26054 conditions, 2060 events. 523/2060 cut-off events. For 132114/132194 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 21291 event pairs, 56 based on Foata normal form. 0/2048 useless extension candidates. Maximal degree in co-relation 25647. Up to 824 conditions per place. [2022-12-13 11:15:06,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 277 places, 487 transitions, 14113 flow [2022-12-13 11:15:06,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-13 11:15:07,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_459| v_~f~0.base_358))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_358 (* v_~x2~0_646 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_358 (* v_~x1~0_696 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_358 (* v_~x2~0_647 4))))) (and (not (= 0 (ite (and (<= 0 v_~x1~0_696) (< v_~x1~0_696 v_~size~0_366)) 1 0))) (not (= (ite (and (< v_~x2~0_647 v_~size~0_366) (<= 0 v_~x2~0_647)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_402|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_505|) 4294967296) (* 2 (mod v_~n~0_366 2147483648))) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_366)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_366) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378|) (not (= (ite (and (< .cse2 v_~size~0_366) (<= 0 .cse2)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_402| 0)) (= v_~x2~0_645 (select .cse3 (+ v_~f~0.offset_358 (* .cse1 4)))) (let ((.cse19 (select .cse3 (+ v_~f~0.offset_358 (* .cse0 4)))) (.cse25 (select .cse3 (+ v_~f~0.offset_358 (* .cse2 4))))) (let ((.cse22 (select .cse3 (+ v_~f~0.offset_358 (* 4 .cse25)))) (.cse23 (select .cse3 (+ v_~f~0.offset_358 (* .cse19 4))))) (let ((.cse21 (select .cse3 (+ v_~f~0.offset_358 (* .cse23 4)))) (.cse26 (select .cse3 (+ v_~f~0.offset_358 (* 4 .cse22))))) (let ((.cse20 (select .cse3 (+ v_~f~0.offset_358 (* .cse26 4)))) (.cse24 (select .cse3 (+ v_~f~0.offset_358 (* 4 .cse21))))) (let ((.cse4 (= (select .cse3 (+ v_~f~0.offset_358 (* .cse24 4))) v_~x2~0_646)) (.cse5 (not (= (ite (and (<= 0 .cse26) (< .cse26 v_~size~0_366)) 1 0) 0))) (.cse6 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_407| 0))) (.cse7 (not (= (ite (and (< .cse25 v_~size~0_366) (<= 0 .cse25)) 1 0) 0))) (.cse8 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_391| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_407|)) (.cse9 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_379| (ite (and (< .cse24 v_~size~0_366) (<= 0 .cse24)) 1 0))) (.cse11 (not (= (ite (and (<= 0 .cse23) (< .cse23 v_~size~0_366)) 1 0) 0))) (.cse12 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_403| 0))) (.cse10 (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_366)) 1 0)) (.cse13 (not (= (ite (and (< .cse22 v_~size~0_366) (<= 0 .cse22)) 1 0) 0))) (.cse14 (= |v_thread2Thread1of1ForFork1_~i~1#1_505| 8)) (.cse16 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_379| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_403|)) (.cse17 (not (= (ite (and (< .cse21 v_~size~0_366) (<= 0 .cse21)) 1 0) 0))) (.cse15 (select .cse3 (+ v_~f~0.offset_358 (* .cse20 4)))) (.cse18 (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_366)) 1 0) 0)))) (or (and .cse4 .cse5 (= |v_thread1Thread1of1ForFork0_~i~0#1_578| 6) .cse6 .cse7 .cse8 .cse9 (= .cse10 |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_391|) .cse11 .cse12 .cse13 .cse14 (= v_~x1~0_695 .cse15) .cse16 .cse17 .cse18) (and .cse4 (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_578|) (= (select .cse3 (+ (* .cse15 4) v_~f~0.offset_358)) v_~x1~0_695) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 (not (= .cse10 0)) .cse13 .cse14 .cse16 .cse17 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_391| (ite (and (< .cse15 v_~size~0_366) (<= 0 .cse15)) 1 0)) .cse18))))))) (not (= (ite (and (<= 0 v_~x2~0_646) (< v_~x2~0_646 v_~size~0_366)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_647, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_358, #memory_int=|v_#memory_int_459|, ~n~0=v_~n~0_366, ~x1~0=v_~x1~0_696, ~f~0.offset=v_~f~0.offset_358} OutVars{~x2~0=v_~x2~0_645, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_409|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_364|, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_358, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_368|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_505|, ~x1~0=v_~x1~0_695, ~f~0.offset=v_~f~0.offset_358, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_402|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_391|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_578|, #memory_int=|v_#memory_int_459|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_407|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_354|, ~n~0=v_~n~0_366, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_354|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_417|} AuxVars[|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_379|, v_~x2~0_646, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_403|] 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 11:15:13,765 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:15:13,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7201 [2022-12-13 11:15:13,766 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 487 transitions, 14228 flow [2022-12-13 11:15:13,766 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 11:15:13,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:15:13,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:15:13,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 11:15:13,766 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 11:15:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:15:13,767 INFO L85 PathProgramCache]: Analyzing trace with hash -771623813, now seen corresponding path program 1 times [2022-12-13 11:15:13,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:15:13,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743721273] [2022-12-13 11:15:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:15:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:16,517 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 11:15:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:15:16,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743721273] [2022-12-13 11:15:16,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743721273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:15:16,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499738248] [2022-12-13 11:15:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:16,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:15:16,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:15:16,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 11:15:16,523 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 11:15:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:16,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 11:15:16,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:15:16,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:16,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 266 [2022-12-13 11:15:18,098 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 11:15:18,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:15:23,367 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 519 DAG size of output: 495 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 11:15:23,369 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-13 11:15:23,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 30 new quantified variables, introduced 120 case distinctions, treesize of input 131 treesize of output 1152 [2022-12-13 11:17:02,427 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 11:17:02,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499738248] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:17:02,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:17:02,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 11:17:02,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18463210] [2022-12-13 11:17:02,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:17:02,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:17:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:17:02,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:17:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:17:02,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 99 [2022-12-13 11:17:02,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 487 transitions, 14228 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:17:02,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:17:02,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 99 [2022-12-13 11:17:02,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:17:05,662 INFO L130 PetriNetUnfolder]: 2231/4679 cut-off events. [2022-12-13 11:17:05,662 INFO L131 PetriNetUnfolder]: For 328449/328449 co-relation queries the response was YES. [2022-12-13 11:17:05,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62610 conditions, 4679 events. 2231/4679 cut-off events. For 328449/328449 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 38728 event pairs, 841 based on Foata normal form. 4/4677 useless extension candidates. Maximal degree in co-relation 61709. Up to 4106 conditions per place. [2022-12-13 11:17:05,722 INFO L137 encePairwiseOnDemand]: 31/99 looper letters, 343 selfloop transitions, 179 changer transitions 5/527 dead transitions. [2022-12-13 11:17:05,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 527 transitions, 16355 flow [2022-12-13 11:17:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:17:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:17:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2022-12-13 11:17:05,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19336219336219337 [2022-12-13 11:17:05,724 INFO L175 Difference]: Start difference. First operand has 277 places, 487 transitions, 14228 flow. Second operand 7 states and 134 transitions. [2022-12-13 11:17:05,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 527 transitions, 16355 flow [2022-12-13 11:17:06,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 527 transitions, 16154 flow, removed 40 selfloop flow, removed 2 redundant places. [2022-12-13 11:17:06,846 INFO L231 Difference]: Finished difference. Result has 283 places, 503 transitions, 15239 flow [2022-12-13 11:17:06,847 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=14045, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15239, PETRI_PLACES=283, PETRI_TRANSITIONS=503} [2022-12-13 11:17:06,847 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 262 predicate places. [2022-12-13 11:17:06,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:17:06,847 INFO L89 Accepts]: Start accepts. Operand has 283 places, 503 transitions, 15239 flow [2022-12-13 11:17:06,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:17:06,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:17:06,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 283 places, 503 transitions, 15239 flow [2022-12-13 11:17:06,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 503 transitions, 15239 flow [2022-12-13 11:17:07,331 INFO L130 PetriNetUnfolder]: 534/2112 cut-off events. [2022-12-13 11:17:07,331 INFO L131 PetriNetUnfolder]: For 141513/141579 co-relation queries the response was YES. [2022-12-13 11:17:07,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27225 conditions, 2112 events. 534/2112 cut-off events. For 141513/141579 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 21933 event pairs, 60 based on Foata normal form. 0/2103 useless extension candidates. Maximal degree in co-relation 26806. Up to 842 conditions per place. [2022-12-13 11:17:07,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 503 transitions, 15239 flow [2022-12-13 11:17:07,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-13 11:17:07,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [797] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_445| v_~f~0.base_346))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_346 (* v_~x2~0_629 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_346 (* v_~x1~0_668 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_346 (* .cse2 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_346 (* .cse5 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_346 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_354)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_392| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_376| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_392|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|) (= (select .cse1 (+ v_~f~0.offset_346 (* .cse0 4))) v_~x2~0_628) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_354)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_629 v_~size~0_354) (<= 0 v_~x2~0_629)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_354) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_559| 3) (= (select .cse1 (+ v_~f~0.offset_346 (* .cse4 4))) v_~x1~0_667) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_354)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_376|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_559| 4294967295) 4294967296) (* 2 (mod v_~n~0_354 2147483648))) (= |v_thread2Thread1of1ForFork1_~i~1#1_490| 4) (not (= (ite (and (< .cse5 v_~size~0_354) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_668) (< v_~x1~0_668 v_~size~0_354)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_629, ~size~0=v_~size~0_354, ~f~0.base=v_~f~0.base_346, #memory_int=|v_#memory_int_445|, ~n~0=v_~n~0_354, ~x1~0=v_~x1~0_668, ~f~0.offset=v_~f~0.offset_346} OutVars{~x2~0=v_~x2~0_628, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_394|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_354|, ~size~0=v_~size~0_354, ~f~0.base=v_~f~0.base_346, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_358|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_490|, ~x1~0=v_~x1~0_667, ~f~0.offset=v_~f~0.offset_346, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_376|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_559|, #memory_int=|v_#memory_int_445|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_392|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_344|, ~n~0=v_~n~0_354, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_344|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_402|} 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 11:17:08,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:17:08,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1421 [2022-12-13 11:17:08,268 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 503 transitions, 15319 flow [2022-12-13 11:17:08,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:17:08,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:17:08,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:17:08,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 11:17:08,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:17:08,469 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 11:17:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:17:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1870452612, now seen corresponding path program 1 times [2022-12-13 11:17:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:17:08,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532395558] [2022-12-13 11:17:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:17:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:17:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:17:10,903 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 11:17:10,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:17:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532395558] [2022-12-13 11:17:10,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532395558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:17:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450333931] [2022-12-13 11:17:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:17:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:17:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:17:10,905 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 11:17:10,906 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 11:17:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:17:11,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 11:17:11,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:17:12,022 INFO L321 Elim1Store]: treesize reduction 71, result has 76.7 percent of original size [2022-12-13 11:17:12,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 36 case distinctions, treesize of input 440 treesize of output 338 [2022-12-13 11:17:13,353 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 11:17:13,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:17:21,427 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 589 DAG size of output: 503 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 11:17:21,429 INFO L321 Elim1Store]: treesize reduction 216, result has 83.6 percent of original size [2022-12-13 11:17:21,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 30 new quantified variables, introduced 136 case distinctions, treesize of input 1851 treesize of output 1499 [2022-12-13 11:18:50,341 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 11:18:50,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450333931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:18:50,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:18:50,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 11:18:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344969436] [2022-12-13 11:18:50,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:18:50,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:18:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:18:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:18:50,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 100 [2022-12-13 11:18:50,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 503 transitions, 15319 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:18:50,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:18:50,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 100 [2022-12-13 11:18:50,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:18:53,935 INFO L130 PetriNetUnfolder]: 2343/4991 cut-off events. [2022-12-13 11:18:53,935 INFO L131 PetriNetUnfolder]: For 358027/358027 co-relation queries the response was YES. [2022-12-13 11:18:53,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67172 conditions, 4991 events. 2343/4991 cut-off events. For 358027/358027 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 42359 event pairs, 385 based on Foata normal form. 2/4989 useless extension candidates. Maximal degree in co-relation 66243. Up to 2690 conditions per place. [2022-12-13 11:18:54,005 INFO L137 encePairwiseOnDemand]: 24/100 looper letters, 333 selfloop transitions, 239 changer transitions 33/605 dead transitions. [2022-12-13 11:18:54,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 605 transitions, 18808 flow [2022-12-13 11:18:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:18:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 11:18:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 169 transitions. [2022-12-13 11:18:54,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14083333333333334 [2022-12-13 11:18:54,006 INFO L175 Difference]: Start difference. First operand has 282 places, 503 transitions, 15319 flow. Second operand 12 states and 169 transitions. [2022-12-13 11:18:54,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 605 transitions, 18808 flow [2022-12-13 11:18:55,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 605 transitions, 18456 flow, removed 81 selfloop flow, removed 4 redundant places. [2022-12-13 11:18:55,668 INFO L231 Difference]: Finished difference. Result has 291 places, 544 transitions, 16901 flow [2022-12-13 11:18:55,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=15024, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16901, PETRI_PLACES=291, PETRI_TRANSITIONS=544} [2022-12-13 11:18:55,669 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 270 predicate places. [2022-12-13 11:18:55,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:18:55,669 INFO L89 Accepts]: Start accepts. Operand has 291 places, 544 transitions, 16901 flow [2022-12-13 11:18:55,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:18:55,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:18:55,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 544 transitions, 16901 flow [2022-12-13 11:18:55,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 544 transitions, 16901 flow [2022-12-13 11:18:56,144 INFO L130 PetriNetUnfolder]: 558/2196 cut-off events. [2022-12-13 11:18:56,144 INFO L131 PetriNetUnfolder]: For 152699/152733 co-relation queries the response was YES. [2022-12-13 11:18:56,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28546 conditions, 2196 events. 558/2196 cut-off events. For 152699/152733 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 22958 event pairs, 53 based on Foata normal form. 1/2191 useless extension candidates. Maximal degree in co-relation 28073. Up to 889 conditions per place. [2022-12-13 11:18:56,184 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 544 transitions, 16901 flow [2022-12-13 11:18:56,184 INFO L226 LiptonReduction]: Number of co-enabled transitions 1260 [2022-12-13 11:18:57,339 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 [692] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_313| v_~f~0.base_226))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_226 (* v_~x2~0_338 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_226 (* .cse0 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_226 (* .cse3 4)))) (.cse4 (* (mod v_~n~0_234 2147483648) 2))) (and (not (= 0 (ite (and (< .cse0 v_~size~0_234) (<= 0 .cse0)) 1 0))) (= v_~x2~0_336 (select .cse1 (+ v_~f~0.offset_226 (* .cse2 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_234)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_234)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_272|) 4294967296) .cse4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209| 0)) (not (= (ite (and (< v_~x2~0_338 v_~size~0_234) (<= 0 v_~x2~0_338)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_274| 4) |v_thread2Thread1of1ForFork1_~i~1#1_272|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_274| 4294967296) .cse4)))))) InVars {~x2~0=v_~x2~0_338, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_274|, ~n~0=v_~n~0_234, ~f~0.offset=v_~f~0.offset_226} OutVars{~x2~0=v_~x2~0_336, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_171|, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_175|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_272|, ~f~0.offset=v_~f~0.offset_226, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_161|, ~n~0=v_~n~0_234, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_161|} 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 11:18:57,599 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 [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 11:18:57,721 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 [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 11:18:57,844 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 [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 11:18:57,962 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 [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 11:18:58,087 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 [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 11:18:58,207 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 [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 11:18:58,329 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 [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 11:18:58,450 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 [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 11:18:58,572 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 [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 11:18:58,696 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 [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 11:18:58,818 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 [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 11:18:58,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_183| v_~f~0.base_110))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_110 (* v_~x1~0_152 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (< .cse0 v_~size~0_120) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (select .cse1 (+ v_~f~0.offset_110 (* .cse0 4))) v_~x1~0_150) (not (= (ite (and (< v_~x1~0_152 v_~size~0_120) (<= 0 v_~x1~0_152)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_132| 2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_132| 4294967295) 4294967296) (* (mod v_~n~0_120 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0))))) InVars {~size~0=v_~size~0_120, ~f~0.base=v_~f~0.base_110, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_120, ~x1~0=v_~x1~0_152, ~f~0.offset=v_~f~0.offset_110} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, ~size~0=v_~size~0_120, ~f~0.base=v_~f~0.base_110, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_132|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_120, ~x1~0=v_~x1~0_150, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ~f~0.offset=v_~f~0.offset_110} AuxVars[] 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 11:18:59,020 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:18:59,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3352 [2022-12-13 11:18:59,021 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 542 transitions, 17473 flow [2022-12-13 11:18:59,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:18:59,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:18:59,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:18:59,027 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 11:18:59,227 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,SelfDestructingSolverStorable53 [2022-12-13 11:18:59,227 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 11:18:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:59,228 INFO L85 PathProgramCache]: Analyzing trace with hash 41754824, now seen corresponding path program 1 times [2022-12-13 11:18:59,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:59,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730647312] [2022-12-13 11:18:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:02,841 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 11:19:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:02,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730647312] [2022-12-13 11:19:02,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730647312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:02,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:02,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:19:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582512060] [2022-12-13 11:19:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:02,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:19:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:19:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:19:02,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 11:19:02,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 542 transitions, 17473 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 11:19:02,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:19:02,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 11:19:02,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:19:06,029 INFO L130 PetriNetUnfolder]: 2291/4865 cut-off events. [2022-12-13 11:19:06,030 INFO L131 PetriNetUnfolder]: For 381597/381597 co-relation queries the response was YES. [2022-12-13 11:19:06,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67057 conditions, 4865 events. 2291/4865 cut-off events. For 381597/381597 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 40875 event pairs, 953 based on Foata normal form. 1/4862 useless extension candidates. Maximal degree in co-relation 66085. Up to 4510 conditions per place. [2022-12-13 11:19:06,100 INFO L137 encePairwiseOnDemand]: 44/110 looper letters, 397 selfloop transitions, 168 changer transitions 8/573 dead transitions. [2022-12-13 11:19:06,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 573 transitions, 19440 flow [2022-12-13 11:19:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:19:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:19:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2022-12-13 11:19:06,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20757575757575758 [2022-12-13 11:19:06,102 INFO L175 Difference]: Start difference. First operand has 286 places, 542 transitions, 17473 flow. Second operand 6 states and 137 transitions. [2022-12-13 11:19:06,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 573 transitions, 19440 flow [2022-12-13 11:19:07,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 573 transitions, 18556 flow, removed 316 selfloop flow, removed 8 redundant places. [2022-12-13 11:19:07,624 INFO L231 Difference]: Finished difference. Result has 286 places, 550 transitions, 17459 flow [2022-12-13 11:19:07,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=16651, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17459, PETRI_PLACES=286, PETRI_TRANSITIONS=550} [2022-12-13 11:19:07,625 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 265 predicate places. [2022-12-13 11:19:07,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:19:07,625 INFO L89 Accepts]: Start accepts. Operand has 286 places, 550 transitions, 17459 flow [2022-12-13 11:19:07,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:19:07,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:19:07,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 550 transitions, 17459 flow [2022-12-13 11:19:07,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 550 transitions, 17459 flow [2022-12-13 11:19:08,066 INFO L130 PetriNetUnfolder]: 555/2069 cut-off events. [2022-12-13 11:19:08,066 INFO L131 PetriNetUnfolder]: For 141447/141468 co-relation queries the response was YES. [2022-12-13 11:19:08,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27463 conditions, 2069 events. 555/2069 cut-off events. For 141447/141468 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20826 event pairs, 43 based on Foata normal form. 0/2061 useless extension candidates. Maximal degree in co-relation 27050. Up to 888 conditions per place. [2022-12-13 11:19:08,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 550 transitions, 17459 flow [2022-12-13 11:19:08,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-13 11:19:08,104 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:19:08,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 480 [2022-12-13 11:19:08,105 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 550 transitions, 17459 flow [2022-12-13 11:19:08,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 11:19:08,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:19:08,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:19:08,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 11:19:08,105 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:19:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash -930338915, now seen corresponding path program 1 times [2022-12-13 11:19:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:08,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712036796] [2022-12-13 11:19:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:08,158 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 11:19:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:08,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712036796] [2022-12-13 11:19:08,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712036796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:08,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:08,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:19:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025017746] [2022-12-13 11:19:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:08,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:19:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:19:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:19:08,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 11:19:08,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 550 transitions, 17459 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:19:08,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:19:08,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 11:19:08,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:19:10,042 INFO L130 PetriNetUnfolder]: 2246/4688 cut-off events. [2022-12-13 11:19:10,042 INFO L131 PetriNetUnfolder]: For 312605/312605 co-relation queries the response was YES. [2022-12-13 11:19:10,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64027 conditions, 4688 events. 2246/4688 cut-off events. For 312605/312605 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 38239 event pairs, 1018 based on Foata normal form. 2/4685 useless extension candidates. Maximal degree in co-relation 63274. Up to 4431 conditions per place. [2022-12-13 11:19:10,112 INFO L137 encePairwiseOnDemand]: 88/110 looper letters, 495 selfloop transitions, 78 changer transitions 0/573 dead transitions. [2022-12-13 11:19:10,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 573 transitions, 19306 flow [2022-12-13 11:19:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:19:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:19:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-12-13 11:19:10,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:19:10,113 INFO L175 Difference]: Start difference. First operand has 285 places, 550 transitions, 17459 flow. Second operand 3 states and 121 transitions. [2022-12-13 11:19:10,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 573 transitions, 19306 flow [2022-12-13 11:19:11,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 573 transitions, 18933 flow, removed 104 selfloop flow, removed 2 redundant places. [2022-12-13 11:19:11,509 INFO L231 Difference]: Finished difference. Result has 286 places, 557 transitions, 17563 flow [2022-12-13 11:19:11,509 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=17034, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=17563, PETRI_PLACES=286, PETRI_TRANSITIONS=557} [2022-12-13 11:19:11,509 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 265 predicate places. [2022-12-13 11:19:11,509 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:19:11,510 INFO L89 Accepts]: Start accepts. Operand has 286 places, 557 transitions, 17563 flow [2022-12-13 11:19:11,513 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:19:11,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:19:11,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 557 transitions, 17563 flow [2022-12-13 11:19:11,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 557 transitions, 17563 flow [2022-12-13 11:19:11,959 INFO L130 PetriNetUnfolder]: 560/2092 cut-off events. [2022-12-13 11:19:11,959 INFO L131 PetriNetUnfolder]: For 141062/141083 co-relation queries the response was YES. [2022-12-13 11:19:11,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27423 conditions, 2092 events. 560/2092 cut-off events. For 141062/141083 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21135 event pairs, 45 based on Foata normal form. 0/2084 useless extension candidates. Maximal degree in co-relation 27019. Up to 899 conditions per place. [2022-12-13 11:19:11,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 557 transitions, 17563 flow [2022-12-13 11:19:11,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 1238 [2022-12-13 11:19:12,001 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:19:12,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-13 11:19:12,001 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 557 transitions, 17563 flow [2022-12-13 11:19:12,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:19:12,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:19:12,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:19:12,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 11:19:12,002 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:19:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 592825594, now seen corresponding path program 1 times [2022-12-13 11:19:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:12,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046298451] [2022-12-13 11:19:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:12,065 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 11:19:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:12,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046298451] [2022-12-13 11:19:12,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046298451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:12,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:12,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:19:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024698188] [2022-12-13 11:19:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:12,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:19:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:12,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:19:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:19:12,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 109 [2022-12-13 11:19:12,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 557 transitions, 17563 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 11:19:12,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:19:12,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 109 [2022-12-13 11:19:12,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:19:14,150 INFO L130 PetriNetUnfolder]: 2265/4725 cut-off events. [2022-12-13 11:19:14,150 INFO L131 PetriNetUnfolder]: For 321134/321134 co-relation queries the response was YES. [2022-12-13 11:19:14,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64445 conditions, 4725 events. 2265/4725 cut-off events. For 321134/321134 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 38608 event pairs, 1046 based on Foata normal form. 16/4736 useless extension candidates. Maximal degree in co-relation 63705. Up to 4537 conditions per place. [2022-12-13 11:19:14,218 INFO L137 encePairwiseOnDemand]: 84/109 looper letters, 531 selfloop transitions, 55 changer transitions 0/586 dead transitions. [2022-12-13 11:19:14,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 586 transitions, 19689 flow [2022-12-13 11:19:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:19:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:19:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-12-13 11:19:14,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24036697247706423 [2022-12-13 11:19:14,220 INFO L175 Difference]: Start difference. First operand has 286 places, 557 transitions, 17563 flow. Second operand 5 states and 131 transitions. [2022-12-13 11:19:14,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 586 transitions, 19689 flow [2022-12-13 11:19:15,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 586 transitions, 19529 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-13 11:19:15,598 INFO L231 Difference]: Finished difference. Result has 290 places, 565 transitions, 18043 flow [2022-12-13 11:19:15,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=17386, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=18043, PETRI_PLACES=290, PETRI_TRANSITIONS=565} [2022-12-13 11:19:15,599 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 269 predicate places. [2022-12-13 11:19:15,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:19:15,599 INFO L89 Accepts]: Start accepts. Operand has 290 places, 565 transitions, 18043 flow [2022-12-13 11:19:15,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:19:15,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:19:15,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 565 transitions, 18043 flow [2022-12-13 11:19:15,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 565 transitions, 18043 flow [2022-12-13 11:19:16,054 INFO L130 PetriNetUnfolder]: 565/2110 cut-off events. [2022-12-13 11:19:16,055 INFO L131 PetriNetUnfolder]: For 148344/148368 co-relation queries the response was YES. [2022-12-13 11:19:16,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28056 conditions, 2110 events. 565/2110 cut-off events. For 148344/148368 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 21413 event pairs, 45 based on Foata normal form. 0/2102 useless extension candidates. Maximal degree in co-relation 27645. Up to 908 conditions per place. [2022-12-13 11:19:16,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 565 transitions, 18043 flow [2022-12-13 11:19:16,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 1270 [2022-12-13 11:19:16,099 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 11:19:16,193 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 11:19:16,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:19:16,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 698 [2022-12-13 11:19:16,297 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 564 transitions, 18061 flow [2022-12-13 11:19:16,297 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 11:19:16,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:19:16,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:19:16,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 11:19:16,298 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:19:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -897079550, now seen corresponding path program 1 times [2022-12-13 11:19:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:16,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630626790] [2022-12-13 11:19:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:16,552 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 11:19:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:16,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630626790] [2022-12-13 11:19:16,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630626790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:19:16,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540732987] [2022-12-13 11:19:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:19:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:19:16,554 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 11:19:16,556 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 11:19:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:16,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 11:19:16,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:19:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:19:16,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:19:16,714 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 11:19:16,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540732987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:19:16,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:19:16,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 11:19:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314353294] [2022-12-13 11:19:16,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:19:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:19:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:19:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:19:16,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 111 [2022-12-13 11:19:16,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 564 transitions, 18061 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 11:19:16,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:19:16,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 111 [2022-12-13 11:19:16,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:19:18,943 INFO L130 PetriNetUnfolder]: 2301/4739 cut-off events. [2022-12-13 11:19:18,944 INFO L131 PetriNetUnfolder]: For 350951/350951 co-relation queries the response was YES. [2022-12-13 11:19:18,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66233 conditions, 4739 events. 2301/4739 cut-off events. For 350951/350951 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 38261 event pairs, 808 based on Foata normal form. 80/4814 useless extension candidates. Maximal degree in co-relation 65524. Up to 3706 conditions per place. [2022-12-13 11:19:19,012 INFO L137 encePairwiseOnDemand]: 49/111 looper letters, 393 selfloop transitions, 255 changer transitions 3/651 dead transitions. [2022-12-13 11:19:19,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 651 transitions, 21804 flow [2022-12-13 11:19:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:19:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 11:19:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2022-12-13 11:19:19,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14504504504504503 [2022-12-13 11:19:19,013 INFO L175 Difference]: Start difference. First operand has 289 places, 564 transitions, 18061 flow. Second operand 10 states and 161 transitions. [2022-12-13 11:19:19,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 651 transitions, 21804 flow [2022-12-13 11:19:20,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 651 transitions, 21470 flow, removed 132 selfloop flow, removed 3 redundant places. [2022-12-13 11:19:20,462 INFO L231 Difference]: Finished difference. Result has 299 places, 599 transitions, 19557 flow [2022-12-13 11:19:20,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=17494, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19557, PETRI_PLACES=299, PETRI_TRANSITIONS=599} [2022-12-13 11:19:20,462 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 278 predicate places. [2022-12-13 11:19:20,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:19:20,462 INFO L89 Accepts]: Start accepts. Operand has 299 places, 599 transitions, 19557 flow [2022-12-13 11:19:20,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:19:20,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:19:20,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 599 transitions, 19557 flow [2022-12-13 11:19:20,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 599 transitions, 19557 flow [2022-12-13 11:19:21,099 INFO L130 PetriNetUnfolder]: 588/2103 cut-off events. [2022-12-13 11:19:21,100 INFO L131 PetriNetUnfolder]: For 158758/158782 co-relation queries the response was YES. [2022-12-13 11:19:21,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29689 conditions, 2103 events. 588/2103 cut-off events. For 158758/158782 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 20891 event pairs, 40 based on Foata normal form. 0/2096 useless extension candidates. Maximal degree in co-relation 29300. Up to 971 conditions per place. [2022-12-13 11:19:21,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 599 transitions, 19557 flow [2022-12-13 11:19:21,137 INFO L226 LiptonReduction]: Number of co-enabled transitions 1332 [2022-12-13 11:19:21,139 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:19:21,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 677 [2022-12-13 11:19:21,139 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 599 transitions, 19557 flow [2022-12-13 11:19:21,139 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 11:19:21,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:19:21,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:19:21,145 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 11:19:21,340 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,SelfDestructingSolverStorable57 [2022-12-13 11:19:21,340 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:19:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1986464664, now seen corresponding path program 1 times [2022-12-13 11:19:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:21,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316126811] [2022-12-13 11:19:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:21,411 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 11:19:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:21,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316126811] [2022-12-13 11:19:21,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316126811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:19:21,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334129480] [2022-12-13 11:19:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:21,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:19:21,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:19:21,413 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 11:19:21,414 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 11:19:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:21,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 11:19:21,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:19:21,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:19:21,553 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 11:19:21,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:19:21,586 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 11:19:22,199 INFO L321 Elim1Store]: treesize reduction 310, result has 14.1 percent of original size [2022-12-13 11:19:22,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 19 new quantified variables, introduced 45 case distinctions, treesize of input 411 treesize of output 138 [2022-12-13 11:19:22,254 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 11:19:22,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:19:23,819 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 11:19:23,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334129480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:19:23,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:19:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 11:19:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300206823] [2022-12-13 11:19:23,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:19:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 11:19:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 11:19:23,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=163, Unknown=3, NotChecked=0, Total=210 [2022-12-13 11:19:23,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 108 [2022-12-13 11:19:23,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 599 transitions, 19557 flow. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 11:19:23,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:19:23,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 108 [2022-12-13 11:19:23,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:19:47,096 WARN L233 SmtUtils]: Spent 22.55s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:20:46,984 WARN L233 SmtUtils]: Spent 54.97s on a formula simplification. DAG size of input: 192 DAG size of output: 189 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:20:57,411 INFO L130 PetriNetUnfolder]: 2713/5658 cut-off events. [2022-12-13 11:20:57,412 INFO L131 PetriNetUnfolder]: For 461080/461080 co-relation queries the response was YES. [2022-12-13 11:20:57,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83369 conditions, 5658 events. 2713/5658 cut-off events. For 461080/461080 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 47791 event pairs, 756 based on Foata normal form. 53/5706 useless extension candidates. Maximal degree in co-relation 82362. Up to 2677 conditions per place. [2022-12-13 11:20:57,488 INFO L137 encePairwiseOnDemand]: 35/108 looper letters, 406 selfloop transitions, 299 changer transitions 36/741 dead transitions. [2022-12-13 11:20:57,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 741 transitions, 25026 flow [2022-12-13 11:20:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:20:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 11:20:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 182 transitions. [2022-12-13 11:20:57,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11234567901234568 [2022-12-13 11:20:57,490 INFO L175 Difference]: Start difference. First operand has 299 places, 599 transitions, 19557 flow. Second operand 15 states and 182 transitions. [2022-12-13 11:20:57,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 741 transitions, 25026 flow [2022-12-13 11:20:59,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 741 transitions, 24649 flow, removed 185 selfloop flow, removed 1 redundant places. [2022-12-13 11:20:59,279 INFO L231 Difference]: Finished difference. Result has 318 places, 636 transitions, 21387 flow [2022-12-13 11:20:59,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=19262, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=21387, PETRI_PLACES=318, PETRI_TRANSITIONS=636} [2022-12-13 11:20:59,280 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 297 predicate places. [2022-12-13 11:20:59,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:20:59,280 INFO L89 Accepts]: Start accepts. Operand has 318 places, 636 transitions, 21387 flow [2022-12-13 11:20:59,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:20:59,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:20:59,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 636 transitions, 21387 flow [2022-12-13 11:20:59,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 636 transitions, 21387 flow [2022-12-13 11:20:59,877 INFO L130 PetriNetUnfolder]: 656/2509 cut-off events. [2022-12-13 11:20:59,877 INFO L131 PetriNetUnfolder]: For 213691/213719 co-relation queries the response was YES. [2022-12-13 11:20:59,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36673 conditions, 2509 events. 656/2509 cut-off events. For 213691/213719 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 26570 event pairs, 57 based on Foata normal form. 0/2502 useless extension candidates. Maximal degree in co-relation 36140. Up to 1121 conditions per place. [2022-12-13 11:21:00,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 636 transitions, 21387 flow [2022-12-13 11:21:00,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 1418 [2022-12-13 11:21:00,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_389| v_~f~0.base_298))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_298 (* v_~x2~0_524 4))))) (let ((.cse0 (select .cse1 (+ (* .cse3 4) v_~f~0.offset_298)))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_298 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_306)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_298 (* .cse2 4))) v_~x2~0_522) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_305| (ite (and (< .cse2 v_~size~0_306) (<= 0 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_421| 4) (not (= (ite (and (< v_~x2~0_524 v_~size~0_306) (<= 0 v_~x2~0_524)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_421|) 4294967296) (* 2 (mod v_~n~0_306 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_305| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|) (not (= (ite (and (< .cse3 v_~size~0_306) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329| 0))))))) InVars {~x2~0=v_~x2~0_524, ~size~0=v_~size~0_306, ~f~0.base=v_~f~0.base_298, #memory_int=|v_#memory_int_389|, ~n~0=v_~n~0_306, ~f~0.offset=v_~f~0.offset_298} OutVars{~x2~0=v_~x2~0_522, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_291|, ~size~0=v_~size~0_306, ~f~0.base=v_~f~0.base_298, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_295|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_305|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_421|, ~f~0.offset=v_~f~0.offset_298, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|, #memory_int=|v_#memory_int_389|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_281|, ~n~0=v_~n~0_306, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_281|} 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 [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:21:00,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:21:00,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1387 [2022-12-13 11:21:00,667 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 636 transitions, 21433 flow [2022-12-13 11:21:00,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 11:21:00,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:21:00,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:00,675 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 11:21:00,873 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,SelfDestructingSolverStorable58 [2022-12-13 11:21:00,874 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:21:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 752715740, now seen corresponding path program 1 times [2022-12-13 11:21:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:00,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030988877] [2022-12-13 11:21:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:03,620 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 11:21:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030988877] [2022-12-13 11:21:03,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030988877] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736966793] [2022-12-13 11:21:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:03,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:03,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:21:03,622 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 11:21:03,624 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 11:21:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:03,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 11:21:03,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:03,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:21:03,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 11:21:03,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:21:03,894 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 11:21:04,936 INFO L321 Elim1Store]: treesize reduction 333, result has 12.1 percent of original size [2022-12-13 11:21:04,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 293 treesize of output 152 [2022-12-13 11:21:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:05,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:07,770 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 11:21:07,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736966793] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:21:07,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:21:07,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:21:07,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606187259] [2022-12-13 11:21:07,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:07,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:21:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:07,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:21:07,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=182, Unknown=2, NotChecked=0, Total=240 [2022-12-13 11:21:07,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 102 [2022-12-13 11:21:07,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 636 transitions, 21433 flow. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 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 11:21:07,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:21:07,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 102 [2022-12-13 11:21:07,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:21:28,596 WARN L233 SmtUtils]: Spent 20.64s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:22:01,820 WARN L233 SmtUtils]: Spent 30.87s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:22:37,709 WARN L233 SmtUtils]: Spent 30.74s on a formula simplification that was a NOOP. DAG size: 213 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:22:40,911 INFO L130 PetriNetUnfolder]: 2716/5696 cut-off events. [2022-12-13 11:22:40,911 INFO L131 PetriNetUnfolder]: For 515771/515771 co-relation queries the response was YES. [2022-12-13 11:22:40,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86889 conditions, 5696 events. 2716/5696 cut-off events. For 515771/515771 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 49193 event pairs, 521 based on Foata normal form. 3/5694 useless extension candidates. Maximal degree in co-relation 85843. Up to 3670 conditions per place. [2022-12-13 11:22:40,996 INFO L137 encePairwiseOnDemand]: 27/102 looper letters, 379 selfloop transitions, 330 changer transitions 27/736 dead transitions. [2022-12-13 11:22:40,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 736 transitions, 25210 flow [2022-12-13 11:22:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:22:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 11:22:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 206 transitions. [2022-12-13 11:22:40,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.08780903665814152 [2022-12-13 11:22:40,998 INFO L175 Difference]: Start difference. First operand has 318 places, 636 transitions, 21433 flow. Second operand 23 states and 206 transitions. [2022-12-13 11:22:40,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 736 transitions, 25210 flow [2022-12-13 11:22:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 736 transitions, 24505 flow, removed 309 selfloop flow, removed 6 redundant places. [2022-12-13 11:22:42,993 INFO L231 Difference]: Finished difference. Result has 345 places, 670 transitions, 23498 flow [2022-12-13 11:22:42,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=20744, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=23498, PETRI_PLACES=345, PETRI_TRANSITIONS=670} [2022-12-13 11:22:42,994 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 324 predicate places. [2022-12-13 11:22:42,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:22:42,994 INFO L89 Accepts]: Start accepts. Operand has 345 places, 670 transitions, 23498 flow [2022-12-13 11:22:42,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:22:42,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:22:42,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 670 transitions, 23498 flow [2022-12-13 11:22:43,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 343 places, 670 transitions, 23498 flow [2022-12-13 11:22:43,709 INFO L130 PetriNetUnfolder]: 662/2507 cut-off events. [2022-12-13 11:22:43,709 INFO L131 PetriNetUnfolder]: For 239955/239983 co-relation queries the response was YES. [2022-12-13 11:22:43,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38512 conditions, 2507 events. 662/2507 cut-off events. For 239955/239983 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 26422 event pairs, 56 based on Foata normal form. 0/2501 useless extension candidates. Maximal degree in co-relation 37983. Up to 1103 conditions per place. [2022-12-13 11:22:43,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 670 transitions, 23498 flow [2022-12-13 11:22:43,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 1502 [2022-12-13 11:22:44,470 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 [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:22:44,586 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 [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:22:45,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [852] $Ultimate##0-->L49-2: Formula: (let ((.cse8 (select |v_#memory_int_543| v_~f~0.base_430))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_430 (* v_~x1~0_829 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_430 (* .cse0 4))))) (let ((.cse10 (select .cse8 (+ v_~f~0.offset_430 (* .cse4 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_430 (* .cse10 4))))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_430 (* v_~x2~0_822 4)))) (.cse9 (select .cse8 (+ v_~f~0.offset_430 (* .cse3 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_430 (* .cse9 4)))) (.cse5 (select .cse8 (+ v_~f~0.offset_430 (* .cse6 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_430 (* .cse5 4)))) (.cse1 (select .cse8 (+ v_~f~0.offset_430 (* 4 .cse2))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_438)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_822 v_~size~0_438) (<= 0 v_~x2~0_822)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_475| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_438)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_475| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_438)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_438) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_438)) 1 0) 0)) (< 6 (* 2 (mod v_~n~0_438 2147483648))) (not (= (ite (and (< .cse5 v_~size~0_438) (<= 0 .cse5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_486| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_510|) (not (= (ite (and (< .cse6 v_~size~0_438) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_510| 0)) (not (= (ite (and (<= 0 v_~x1~0_829) (< v_~x1~0_829 v_~size~0_438)) 1 0) 0)) (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_438)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_486|) (= (select .cse8 (+ v_~f~0.offset_430 (* .cse7 4))) v_~x2~0_821) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_438)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_629| 4) (= (select .cse8 (+ v_~f~0.offset_430 (* .cse1 4))) v_~x1~0_827) (= |v_thread1Thread1of1ForFork0_~i~0#1_683| 8) (not (= (ite (and (< .cse10 v_~size~0_438) (<= 0 .cse10)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_822, ~size~0=v_~size~0_438, ~f~0.base=v_~f~0.base_430, #memory_int=|v_#memory_int_543|, ~n~0=v_~n~0_438, ~x1~0=v_~x1~0_829, ~f~0.offset=v_~f~0.offset_430} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_486|, ~x2~0=v_~x2~0_821, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_460|, ~size~0=v_~size~0_438, ~f~0.base=v_~f~0.base_430, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_464|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_486|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_629|, ~x1~0=v_~x1~0_827, ~f~0.offset=v_~f~0.offset_430, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_510|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_475|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_683|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491|, #memory_int=|v_#memory_int_543|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_450|, ~n~0=v_~n~0_438, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_494|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_450|} 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 [692] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_313| v_~f~0.base_226))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_226 (* v_~x2~0_338 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_226 (* .cse0 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_226 (* .cse3 4)))) (.cse4 (* (mod v_~n~0_234 2147483648) 2))) (and (not (= 0 (ite (and (< .cse0 v_~size~0_234) (<= 0 .cse0)) 1 0))) (= v_~x2~0_336 (select .cse1 (+ v_~f~0.offset_226 (* .cse2 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_234)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_234)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_272|) 4294967296) .cse4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209| 0)) (not (= (ite (and (< v_~x2~0_338 v_~size~0_234) (<= 0 v_~x2~0_338)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_274| 4) |v_thread2Thread1of1ForFork1_~i~1#1_272|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_274| 4294967296) .cse4)))))) InVars {~x2~0=v_~x2~0_338, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_274|, ~n~0=v_~n~0_234, ~f~0.offset=v_~f~0.offset_226} OutVars{~x2~0=v_~x2~0_336, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_171|, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_175|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_272|, ~f~0.offset=v_~f~0.offset_226, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_161|, ~n~0=v_~n~0_234, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_161|} 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 11:22:47,361 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:22:47,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4367 [2022-12-13 11:22:47,361 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 668 transitions, 23591 flow [2022-12-13 11:22:47,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 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 11:22:47,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:47,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:47,367 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 11:22:47,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:47,563 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:22:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1345032495, now seen corresponding path program 1 times [2022-12-13 11:22:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:47,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811367628] [2022-12-13 11:22:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:47,626 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 11:22:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:47,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811367628] [2022-12-13 11:22:47,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811367628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:47,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335936341] [2022-12-13 11:22:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:47,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:22:47,628 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 11:22:47,629 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 11:22:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:47,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:22:47,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:22:47,890 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 11:22:47,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:47,921 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 11:22:47,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335936341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:22:47,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:22:47,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 11:22:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833478178] [2022-12-13 11:22:47,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:47,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:22:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:22:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:22:47,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 105 [2022-12-13 11:22:47,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 668 transitions, 23591 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:22:47,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:47,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 105 [2022-12-13 11:22:47,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:52,219 INFO L130 PetriNetUnfolder]: 2927/6111 cut-off events. [2022-12-13 11:22:52,220 INFO L131 PetriNetUnfolder]: For 668652/668652 co-relation queries the response was YES. [2022-12-13 11:22:52,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98767 conditions, 6111 events. 2927/6111 cut-off events. For 668652/668652 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 52579 event pairs, 669 based on Foata normal form. 118/6224 useless extension candidates. Maximal degree in co-relation 97388. Up to 3669 conditions per place. [2022-12-13 11:22:52,311 INFO L137 encePairwiseOnDemand]: 28/105 looper letters, 394 selfloop transitions, 396 changer transitions 22/812 dead transitions. [2022-12-13 11:22:52,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 812 transitions, 30414 flow [2022-12-13 11:22:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:22:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 11:22:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 189 transitions. [2022-12-13 11:22:52,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12857142857142856 [2022-12-13 11:22:52,312 INFO L175 Difference]: Start difference. First operand has 341 places, 668 transitions, 23591 flow. Second operand 14 states and 189 transitions. [2022-12-13 11:22:52,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 812 transitions, 30414 flow [2022-12-13 11:22:54,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 812 transitions, 28601 flow, removed 859 selfloop flow, removed 7 redundant places. [2022-12-13 11:22:54,772 INFO L231 Difference]: Finished difference. Result has 355 places, 722 transitions, 25696 flow [2022-12-13 11:22:54,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=21990, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=25696, PETRI_PLACES=355, PETRI_TRANSITIONS=722} [2022-12-13 11:22:54,773 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 334 predicate places. [2022-12-13 11:22:54,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:22:54,773 INFO L89 Accepts]: Start accepts. Operand has 355 places, 722 transitions, 25696 flow [2022-12-13 11:22:54,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:22:54,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:22:54,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 355 places, 722 transitions, 25696 flow [2022-12-13 11:22:54,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 722 transitions, 25696 flow [2022-12-13 11:22:55,468 INFO L130 PetriNetUnfolder]: 716/2702 cut-off events. [2022-12-13 11:22:55,468 INFO L131 PetriNetUnfolder]: For 306726/306766 co-relation queries the response was YES. [2022-12-13 11:22:55,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44180 conditions, 2702 events. 716/2702 cut-off events. For 306726/306766 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 28935 event pairs, 59 based on Foata normal form. 1/2698 useless extension candidates. Maximal degree in co-relation 43986. Up to 1017 conditions per place. [2022-12-13 11:22:55,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 353 places, 722 transitions, 25696 flow [2022-12-13 11:22:55,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 1602 [2022-12-13 11:22:56,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [856] $Ultimate##0-->L49-2: Formula: (let ((.cse9 (select |v_#memory_int_549| v_~f~0.base_436))) (let ((.cse8 (select .cse9 (+ v_~f~0.offset_436 (* v_~x1~0_843 4))))) (let ((.cse6 (select .cse9 (+ v_~f~0.offset_436 (* .cse8 4))))) (let ((.cse3 (select .cse9 (+ v_~f~0.offset_436 (* .cse6 4))))) (let ((.cse1 (select .cse9 (+ v_~f~0.offset_436 (* 4 .cse3)))) (.cse2 (select .cse9 (+ v_~f~0.offset_436 (* v_~x2~0_826 4))))) (let ((.cse11 (select .cse9 (+ (* .cse2 4) v_~f~0.offset_436))) (.cse0 (select .cse9 (+ v_~f~0.offset_436 (* .cse1 4))))) (let ((.cse4 (select .cse9 (+ v_~f~0.offset_436 (* .cse0 4)))) (.cse7 (select .cse9 (+ v_~f~0.offset_436 (* .cse11 4))))) (let ((.cse12 (select .cse9 (+ v_~f~0.offset_436 (* 4 .cse7)))) (.cse13 (select .cse9 (+ v_~f~0.offset_436 (* .cse4 4))))) (let ((.cse10 (select .cse9 (+ v_~f~0.offset_436 (* 4 .cse13)))) (.cse5 (select .cse9 (+ v_~f~0.offset_436 (* .cse12 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_444) (<= 0 .cse0)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_691| 4294967295) 4294967296) (* 2 (mod v_~n~0_444 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_488| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_512|) (not (= (ite (and (< .cse1 v_~size~0_444) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_444)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_826) (< v_~x2~0_826 v_~size~0_444)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_635|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_512| 0)) (not (= (ite (and (< .cse3 v_~size~0_444) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_444) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_843) (< v_~x1~0_843 v_~size~0_444)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_499|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_488| (ite (and (< .cse5 v_~size~0_444) (<= 0 .cse5)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_444) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_444) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_691| 9) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_444)) 1 0) 0)) (= v_~x1~0_841 (select .cse9 (+ v_~f~0.offset_436 (* .cse10 4)))) (not (= (ite (and (< .cse11 v_~size~0_444) (<= 0 .cse11)) 1 0) 0)) (= (ite (and (< .cse10 v_~size~0_444) (<= 0 .cse10)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_499| 0)) (= (select .cse9 (+ v_~f~0.offset_436 (* .cse5 4))) v_~x2~0_825) (not (= (ite (and (< .cse12 v_~size~0_444) (<= 0 .cse12)) 1 0) 0)) (not (= 0 (ite (and (< .cse13 v_~size~0_444) (<= 0 .cse13)) 1 0))))))))))))) InVars {~x2~0=v_~x2~0_826, ~size~0=v_~size~0_444, ~f~0.base=v_~f~0.base_436, #memory_int=|v_#memory_int_549|, ~n~0=v_~n~0_444, ~x1~0=v_~x1~0_843, ~f~0.offset=v_~f~0.offset_436} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_494|, ~x2~0=v_~x2~0_825, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_462|, ~size~0=v_~size~0_444, ~f~0.base=v_~f~0.base_436, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_466|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_488|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_635|, ~x1~0=v_~x1~0_841, ~f~0.offset=v_~f~0.offset_436, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_512|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_691|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_499|, #memory_int=|v_#memory_int_549|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_452|, ~n~0=v_~n~0_444, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_502|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_452|} 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 11:22:57,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [810] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_469| v_~f~0.base_366))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_366 (* v_~x2~0_668 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_366 (* .cse1 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_366 (* .cse0 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_366 (* .cse4 4))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_366 (* .cse5 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_366 (* 4 .cse7))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_366 (* .cse6 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_374)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_374) (<= 0 .cse1)) 1 0) 0)) (= v_~x2~0_666 (select .cse2 (+ v_~f~0.offset_366 (* 4 .cse3)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_517| 8) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_374)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_415| 0)) (not (= (ite (and (<= 0 v_~x2~0_668) (< v_~x2~0_668 v_~size~0_374)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_374)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_374)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_374)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_374) (<= 0 .cse7)) 1 0) 0)) (< 6 (* (mod v_~n~0_374 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_415|)))))))))) InVars {~x2~0=v_~x2~0_668, ~size~0=v_~size~0_374, ~f~0.base=v_~f~0.base_366, #memory_int=|v_#memory_int_469|, ~n~0=v_~n~0_374, ~f~0.offset=v_~f~0.offset_366} OutVars{~x2~0=v_~x2~0_666, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_376|, ~size~0=v_~size~0_374, ~f~0.base=v_~f~0.base_366, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_380|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_517|, ~f~0.offset=v_~f~0.offset_366, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_415|, #memory_int=|v_#memory_int_469|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_366|, ~n~0=v_~n~0_374, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_366|} 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 [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:22:59,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [860] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_555| v_~f~0.base_442))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_442 (* v_~x1~0_859 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_442 (* .cse8 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_442 (* .cse7 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_442 (* 4 .cse11))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_442 (* .cse5 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_442 (* .cse10 4)))) (.cse9 (select .cse0 (+ v_~f~0.offset_442 (* v_~x2~0_841 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_442 (* .cse9 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_442 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_442 (* .cse2 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_442 (* 4 .cse4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_702| 4294967295) 4294967296) (* (mod v_~n~0_450 2147483648) 2)) (not (= (ite (and (< v_~x1~0_859 v_~size~0_450) (<= 0 v_~x1~0_859)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_521| 0)) (= v_~x1~0_857 (select .cse0 (+ v_~f~0.offset_442 (* .cse1 4)))) (not (= (ite (and (< .cse2 v_~size~0_450) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_644| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509|) (not (= 0 (ite (and (< .cse3 v_~size~0_450) (<= 0 .cse3)) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509| 0)) (not (= (ite (and (< v_~x2~0_841 v_~size~0_450) (<= 0 v_~x2~0_841)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_450)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_450) (<= 0 .cse5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_497| (ite (and (< .cse6 v_~size~0_450) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_450) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_497| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_521|) (not (= (ite (and (< .cse8 v_~size~0_450) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_450) (<= 0 .cse9)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| (ite (and (< .cse1 v_~size~0_450) (<= 0 .cse1)) 1 0)) (= v_~x2~0_840 (select .cse0 (+ v_~f~0.offset_442 (* .cse6 4)))) (not (= (ite (and (< .cse10 v_~size~0_450) (<= 0 .cse10)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_702| 9) (not (= (ite (and (< .cse11 v_~size~0_450) (<= 0 .cse11)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_841, ~size~0=v_~size~0_450, ~f~0.base=v_~f~0.base_442, #memory_int=|v_#memory_int_555|, ~n~0=v_~n~0_450, ~x1~0=v_~x1~0_859, ~f~0.offset=v_~f~0.offset_442} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_504|, ~x2~0=v_~x2~0_840, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_471|, ~size~0=v_~size~0_450, ~f~0.base=v_~f~0.base_442, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_475|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_497|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_644|, ~x1~0=v_~x1~0_857, ~f~0.offset=v_~f~0.offset_442, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_521|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_702|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509|, #memory_int=|v_#memory_int_555|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_461|, ~n~0=v_~n~0_450, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_512|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_461|} 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 [692] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_313| v_~f~0.base_226))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_226 (* v_~x2~0_338 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_226 (* .cse0 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_226 (* .cse3 4)))) (.cse4 (* (mod v_~n~0_234 2147483648) 2))) (and (not (= 0 (ite (and (< .cse0 v_~size~0_234) (<= 0 .cse0)) 1 0))) (= v_~x2~0_336 (select .cse1 (+ v_~f~0.offset_226 (* .cse2 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_234)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_234)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_272|) 4294967296) .cse4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209| 0)) (not (= (ite (and (< v_~x2~0_338 v_~size~0_234) (<= 0 v_~x2~0_338)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_274| 4) |v_thread2Thread1of1ForFork1_~i~1#1_272|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_274| 4294967296) .cse4)))))) InVars {~x2~0=v_~x2~0_338, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_274|, ~n~0=v_~n~0_234, ~f~0.offset=v_~f~0.offset_226} OutVars{~x2~0=v_~x2~0_336, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_171|, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_175|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_185|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_272|, ~f~0.offset=v_~f~0.offset_226, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_161|, ~n~0=v_~n~0_234, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_161|} 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 11:23:00,624 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:23:00,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5852 [2022-12-13 11:23:00,625 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 721 transitions, 25807 flow [2022-12-13 11:23:00,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:23:00,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:23:00,625 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:23:00,631 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 11:23:00,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:00,826 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:23:00,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1799209939, now seen corresponding path program 1 times [2022-12-13 11:23:00,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:00,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911455748] [2022-12-13 11:23:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:00,898 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 11:23:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:23:00,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911455748] [2022-12-13 11:23:00,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911455748] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:23:00,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370752415] [2022-12-13 11:23:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:00,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:00,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:23:00,899 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 11:23:00,901 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 11:23:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:01,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 11:23:01,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:23:01,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:01,038 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 11:23:01,041 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 11:23:01,067 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 11:23:01,260 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-13 11:23:01,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 64 [2022-12-13 11:23:01,291 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 11:23:01,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:23:01,641 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 11:23:01,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370752415] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:23:01,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:23:01,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 11:23:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121808848] [2022-12-13 11:23:01,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:23:01,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 11:23:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:23:01,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 11:23:01,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=164, Unknown=2, NotChecked=0, Total=210 [2022-12-13 11:23:01,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 108 [2022-12-13 11:23:01,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 721 transitions, 25807 flow. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 11:23:01,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:23:01,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 108 [2022-12-13 11:23:01,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:23:22,370 INFO L130 PetriNetUnfolder]: 3297/6883 cut-off events. [2022-12-13 11:23:22,371 INFO L131 PetriNetUnfolder]: For 860457/860457 co-relation queries the response was YES. [2022-12-13 11:23:22,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119608 conditions, 6883 events. 3297/6883 cut-off events. For 860457/860457 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 60033 event pairs, 719 based on Foata normal form. 28/6908 useless extension candidates. Maximal degree in co-relation 118286. Up to 2814 conditions per place. [2022-12-13 11:23:22,472 INFO L137 encePairwiseOnDemand]: 25/108 looper letters, 479 selfloop transitions, 429 changer transitions 29/937 dead transitions. [2022-12-13 11:23:22,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 937 transitions, 35034 flow [2022-12-13 11:23:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 11:23:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 11:23:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 237 transitions. [2022-12-13 11:23:22,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09143518518518519 [2022-12-13 11:23:22,473 INFO L175 Difference]: Start difference. First operand has 352 places, 721 transitions, 25807 flow. Second operand 24 states and 237 transitions. [2022-12-13 11:23:22,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 937 transitions, 35034 flow [2022-12-13 11:23:25,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 937 transitions, 33894 flow, removed 525 selfloop flow, removed 6 redundant places. [2022-12-13 11:23:25,951 INFO L231 Difference]: Finished difference. Result has 375 places, 780 transitions, 28716 flow [2022-12-13 11:23:25,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=24817, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=28716, PETRI_PLACES=375, PETRI_TRANSITIONS=780} [2022-12-13 11:23:25,952 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 354 predicate places. [2022-12-13 11:23:25,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:23:25,952 INFO L89 Accepts]: Start accepts. Operand has 375 places, 780 transitions, 28716 flow [2022-12-13 11:23:25,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:23:25,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:23:25,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 780 transitions, 28716 flow [2022-12-13 11:23:25,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 374 places, 780 transitions, 28716 flow [2022-12-13 11:23:26,854 INFO L130 PetriNetUnfolder]: 796/3016 cut-off events. [2022-12-13 11:23:26,855 INFO L131 PetriNetUnfolder]: For 383820/383860 co-relation queries the response was YES. [2022-12-13 11:23:26,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51538 conditions, 3016 events. 796/3016 cut-off events. For 383820/383860 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 33067 event pairs, 73 based on Foata normal form. 1/3010 useless extension candidates. Maximal degree in co-relation 50906. Up to 1123 conditions per place. [2022-12-13 11:23:26,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 374 places, 780 transitions, 28716 flow [2022-12-13 11:23:26,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 1742 [2022-12-13 11:23:26,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [864] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_561| v_~f~0.base_448))) (let ((.cse1 (select .cse7 (+ v_~f~0.offset_448 (* v_~x2~0_856 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_448 (* .cse1 4))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_448 (* 4 .cse3))))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_448 (* .cse0 4))))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_448 (* .cse8 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_448 (* .cse9 4))))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_448 (* .cse5 4))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_448 (* 4 .cse6))))) (let ((.cse4 (select .cse7 (+ v_~f~0.offset_448 (* .cse2 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_456)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_652| 10) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_456)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_456) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_456)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_505| (ite (and (< .cse4 v_~size~0_456) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_456) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_456) (<= 0 .cse6)) 1 0) 0)) (= (select .cse7 (+ v_~f~0.offset_448 (* .cse4 4))) v_~x2~0_854) (not (= (ite (and (<= 0 v_~x2~0_856) (< v_~x2~0_856 v_~size~0_456)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_456) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_505| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_529|) (< 8 (* 2 (mod v_~n~0_456 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_529| 0)) (not (= (ite (and (< .cse9 v_~size~0_456) (<= 0 .cse9)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_856, ~size~0=v_~size~0_456, ~f~0.base=v_~f~0.base_448, #memory_int=|v_#memory_int_561|, ~n~0=v_~n~0_456, ~f~0.offset=v_~f~0.offset_448} OutVars{~x2~0=v_~x2~0_854, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_479|, ~size~0=v_~size~0_456, ~f~0.base=v_~f~0.base_448, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_483|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_505|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_652|, ~f~0.offset=v_~f~0.offset_448, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_529|, #memory_int=|v_#memory_int_561|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_469|, ~n~0=v_~n~0_456, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_469|} 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 [623] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_195| v_~f~0.base_120))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_120 (* v_~x1~0_178 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 2) (< 1 (* 2 (mod v_~n~0_130 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_130)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= (ite (and (<= 0 v_~x1~0_178) (< v_~x1~0_178 v_~size~0_130)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (= v_~x1~0_176 (select .cse1 (+ v_~f~0.offset_120 (* .cse0 4))))))) InVars {~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_178, ~f~0.offset=v_~f~0.offset_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_120, 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_94|, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_176, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|, ~f~0.offset=v_~f~0.offset_120} AuxVars[] 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 11:23:28,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [850] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_538| v_~f~0.base_428))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_428 (* v_~x2~0_814 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_428 (* .cse1 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_428 (* .cse2 4)))) (.cse3 (select .cse4 (+ v_~f~0.offset_428 (* v_~x1~0_819 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481| (ite (and (< .cse0 v_~size~0_436) (<= 0 .cse0)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484| 0)) (not (= (ite (and (< .cse1 v_~size~0_436) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_436)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_505| 0)) (not (= 0 (ite (and (< v_~x2~0_814 v_~size~0_436) (<= 0 v_~x2~0_814)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_468| (ite (and (< .cse3 v_~size~0_436) (<= 0 .cse3)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_624|) 4294967296) (* 2 (mod v_~n~0_436 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_468| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|) (= v_~x2~0_813 (select .cse4 (+ v_~f~0.offset_428 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_505|) (= |v_thread2Thread1of1ForFork1_~i~1#1_624| 4) (= |v_thread1Thread1of1ForFork0_~i~0#1_679| 2) (not (= (ite (and (<= 0 v_~x1~0_819) (< v_~x1~0_819 v_~size~0_436)) 1 0) 0)) (= v_~x1~0_818 (select .cse4 (+ v_~f~0.offset_428 (* .cse3 4))))))))) InVars {~x2~0=v_~x2~0_814, ~size~0=v_~size~0_436, ~f~0.base=v_~f~0.base_428, #memory_int=|v_#memory_int_538|, ~n~0=v_~n~0_436, ~x1~0=v_~x1~0_819, ~f~0.offset=v_~f~0.offset_428} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_482|, ~x2~0=v_~x2~0_813, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_455|, ~size~0=v_~size~0_436, ~f~0.base=v_~f~0.base_428, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_459|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_624|, ~x1~0=v_~x1~0_818, ~f~0.offset=v_~f~0.offset_428, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_505|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_468|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_679|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|, #memory_int=|v_#memory_int_538|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_445|, ~n~0=v_~n~0_436, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_490|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_445|} 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 11:23:29,275 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:23:29,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3324 [2022-12-13 11:23:29,276 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 779 transitions, 28780 flow [2022-12-13 11:23:29,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 11:23:29,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:23:29,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:23:29,281 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 11:23:29,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:29,479 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:23:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 194253332, now seen corresponding path program 2 times [2022-12-13 11:23:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:29,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530347481] [2022-12-13 11:23:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:31,907 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 11:23:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:23:31,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530347481] [2022-12-13 11:23:31,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530347481] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:23:31,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988699828] [2022-12-13 11:23:31,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:23:31,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:31,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:23:31,908 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 11:23:31,910 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 11:23:32,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:23:32,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:23:32,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 11:23:32,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:23:32,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:32,170 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 11:23:32,173 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 11:23:32,203 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 11:23:32,848 INFO L321 Elim1Store]: treesize reduction 331, result has 12.7 percent of original size [2022-12-13 11:23:32,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 263 treesize of output 136 [2022-12-13 11:23:33,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 11:23:33,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:23:34,743 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 11:23:34,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988699828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:23:34,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:23:34,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-13 11:23:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525913423] [2022-12-13 11:23:34,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:23:34,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:23:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:23:34,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:23:34,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=208, Unknown=3, NotChecked=0, Total=306 [2022-12-13 11:23:34,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 11:23:34,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 779 transitions, 28780 flow. Second operand has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 11:23:34,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:23:34,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 11:23:34,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:23:55,838 WARN L233 SmtUtils]: Spent 20.80s on a formula simplification that was a NOOP. DAG size: 239 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-13 11:23:58,733 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 11:23:58,733 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 11:23:59,745 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 11:23:59,934 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 11:23:59,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-13 11:23:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:23:59,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 11:23:59,974 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:491) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-13 11:23:59,977 INFO L158 Benchmark]: Toolchain (without parser) took 798271.87ms. Allocated memory was 182.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 158.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-13 11:23:59,977 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory was 160.2MB in the beginning and 160.1MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:23:59,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.16ms. Allocated memory is still 182.5MB. Free memory was 158.3MB in the beginning and 147.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 11:23:59,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 182.5MB. Free memory was 147.2MB in the beginning and 145.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:23:59,978 INFO L158 Benchmark]: Boogie Preprocessor took 40.10ms. Allocated memory is still 182.5MB. Free memory was 145.2MB in the beginning and 143.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:23:59,978 INFO L158 Benchmark]: RCFGBuilder took 488.67ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 127.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 11:23:59,978 INFO L158 Benchmark]: TraceAbstraction took 797439.78ms. Allocated memory was 182.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 126.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-13 11:23:59,979 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.15ms. Allocated memory is still 182.5MB. Free memory was 160.2MB in the beginning and 160.1MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.16ms. Allocated memory is still 182.5MB. Free memory was 158.3MB in the beginning and 147.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 182.5MB. Free memory was 147.2MB in the beginning and 145.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.10ms. Allocated memory is still 182.5MB. Free memory was 145.2MB in the beginning and 143.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 488.67ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 127.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 797439.78ms. Allocated memory was 182.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 126.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 1115, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1168, Positive cache size: 1166, Positive conditional cache size: 1166, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 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: 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: 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: 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 - 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: 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: 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: 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 - 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 14, 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): 7, Positive cache size: 7, Positive conditional cache size: 7, 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 - 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: 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: 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: 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: 7, 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 - 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 12, 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): 13, Positive cache size: 13, Positive conditional cache size: 13, 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 - 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: 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: 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: 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): 13, Positive cache size: 13, Positive conditional cache size: 13, 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 - 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: 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: 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: 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): 13, Positive cache size: 13, Positive conditional cache size: 13, 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 - 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: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 13, Positive conditional cache size: 13, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 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: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 13, Positive conditional cache size: 13, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 36 PlacesBefore, 34 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 38, independent: 23, independent conditional: 23, 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): 64, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 49 PlacesBefore, 49 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 70, Positive conditional cache size: 70, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 58 PlacesBefore, 58 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 78, Positive conditional cache size: 78, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 70 PlacesBefore, 70 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 70 PlacesBefore, 70 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 91, Positive cache size: 89, Positive conditional cache size: 89, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 91, Positive cache size: 89, Positive conditional cache size: 89, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 91, Positive cache size: 89, Positive conditional cache size: 89, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 80 PlacesBefore, 80 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 93, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 93, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 94 PlacesBefore, 95 PlacesAfterwards, 122 TransitionsBefore, 124 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 40, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 111, Positive conditional cache size: 111, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 113, Positive cache size: 111, Positive conditional cache size: 111, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 102 PlacesBefore, 105 PlacesAfterwards, 118 TransitionsBefore, 121 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 27, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 122, Positive conditional cache size: 122, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 124, Positive cache size: 122, Positive conditional cache size: 122, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 124, Positive cache size: 122, Positive conditional cache size: 122, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 124 PlacesBefore, 124 PlacesAfterwards, 171 TransitionsBefore, 171 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 127, Positive conditional cache size: 127, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 136 PlacesBefore, 135 PlacesAfterwards, 187 TransitionsBefore, 186 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 20, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 152, Positive conditional cache size: 152, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 134 PlacesBefore, 134 PlacesAfterwards, 184 TransitionsBefore, 184 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 154, Positive cache size: 152, Positive conditional cache size: 152, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 150 PlacesBefore, 150 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 38, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 324, Positive conditional cache size: 324, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 149 PlacesBefore, 149 PlacesAfterwards, 197 TransitionsBefore, 196 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 327, Positive cache size: 325, Positive conditional cache size: 325, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 147 PlacesBefore, 147 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 330, Positive conditional cache size: 330, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 150 PlacesBefore, 150 PlacesAfterwards, 197 TransitionsBefore, 197 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 333, Positive cache size: 331, Positive conditional cache size: 331, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 333, Positive cache size: 331, Positive conditional cache size: 331, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 154 PlacesBefore, 154 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 333, Positive cache size: 331, Positive conditional cache size: 331, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 160 PlacesBefore, 160 PlacesAfterwards, 202 TransitionsBefore, 202 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 333, Positive cache size: 331, Positive conditional cache size: 331, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.9s, 180 PlacesBefore, 180 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 19, independent: 12, independent conditional: 12, 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): 362, Positive cache size: 360, Positive conditional cache size: 360, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 194 PlacesBefore, 193 PlacesAfterwards, 252 TransitionsBefore, 251 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 6, independent: 0, independent conditional: 0, 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): 391, Positive cache size: 389, Positive conditional cache size: 389, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 194 PlacesBefore, 194 PlacesAfterwards, 256 TransitionsBefore, 255 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 393, Positive cache size: 391, Positive conditional cache size: 391, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 193 PlacesBefore, 193 PlacesAfterwards, 258 TransitionsBefore, 258 TransitionsAfterwards, 688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 393, Positive cache size: 391, Positive conditional cache size: 391, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 194 PlacesBefore, 194 PlacesAfterwards, 259 TransitionsBefore, 259 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 393, Positive cache size: 391, Positive conditional cache size: 391, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 201 PlacesBefore, 201 PlacesAfterwards, 270 TransitionsBefore, 270 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 393, Positive cache size: 391, Positive conditional cache size: 391, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 226 PlacesBefore, 226 PlacesAfterwards, 297 TransitionsBefore, 297 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 424, Positive conditional cache size: 424, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 226 PlacesBefore, 226 PlacesAfterwards, 299 TransitionsBefore, 299 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 430, Positive cache size: 428, Positive conditional cache size: 428, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 226 PlacesBefore, 227 PlacesAfterwards, 327 TransitionsBefore, 328 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 463, Positive conditional cache size: 463, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 244 PlacesBefore, 244 PlacesAfterwards, 360 TransitionsBefore, 360 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 466, Positive cache size: 464, Positive conditional cache size: 464, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 260 PlacesBefore, 259 PlacesAfterwards, 445 TransitionsBefore, 444 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 474, Positive conditional cache size: 474, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 271 PlacesBefore, 271 PlacesAfterwards, 457 TransitionsBefore, 457 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 476, Positive cache size: 474, Positive conditional cache size: 474, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 276 PlacesBefore, 276 PlacesAfterwards, 466 TransitionsBefore, 466 TransitionsAfterwards, 1168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 477, Positive cache size: 475, Positive conditional cache size: 475, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 275 PlacesBefore, 274 PlacesAfterwards, 463 TransitionsBefore, 462 TransitionsAfterwards, 1146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 479, Positive cache size: 477, Positive conditional cache size: 477, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 272 PlacesBefore, 272 PlacesAfterwards, 460 TransitionsBefore, 460 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 479, Positive cache size: 477, Positive conditional cache size: 477, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 276 PlacesBefore, 276 PlacesAfterwards, 470 TransitionsBefore, 470 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 480, Positive cache size: 478, Positive conditional cache size: 478, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 277 PlacesBefore, 277 PlacesAfterwards, 487 TransitionsBefore, 487 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 480, Positive conditional cache size: 480, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 282 PlacesBefore, 282 PlacesAfterwards, 503 TransitionsBefore, 503 TransitionsAfterwards, 1230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 483, Positive cache size: 481, Positive conditional cache size: 481, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 288 PlacesBefore, 286 PlacesAfterwards, 544 TransitionsBefore, 542 TransitionsAfterwards, 1260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 521, Positive cache size: 519, Positive conditional cache size: 519, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 285 PlacesBefore, 285 PlacesAfterwards, 550 TransitionsBefore, 550 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 521, Positive cache size: 519, Positive conditional cache size: 519, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 286 PlacesBefore, 286 PlacesAfterwards, 557 TransitionsBefore, 557 TransitionsAfterwards, 1238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 521, Positive cache size: 519, Positive conditional cache size: 519, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 290 PlacesBefore, 289 PlacesAfterwards, 565 TransitionsBefore, 564 TransitionsAfterwards, 1270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 522, Positive cache size: 520, Positive conditional cache size: 520, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 299 PlacesBefore, 299 PlacesAfterwards, 599 TransitionsBefore, 599 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 522, Positive cache size: 520, Positive conditional cache size: 520, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 318 PlacesBefore, 318 PlacesAfterwards, 636 TransitionsBefore, 636 TransitionsAfterwards, 1418 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 523, Positive cache size: 521, Positive conditional cache size: 521, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 343 PlacesBefore, 341 PlacesAfterwards, 670 TransitionsBefore, 668 TransitionsAfterwards, 1502 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 526, Positive conditional cache size: 526, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 353 PlacesBefore, 352 PlacesAfterwards, 722 TransitionsBefore, 721 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 530, Positive conditional cache size: 530, Positive unconditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 374 PlacesBefore, 374 PlacesAfterwards, 780 TransitionsBefore, 779 TransitionsAfterwards, 1742 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 532, Positive conditional cache size: 532, Positive unconditional cache size: 0, 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown